/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix010_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:24:49,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:24:49,977 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:24:49,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:24:49,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:24:49,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:24:49,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:24:50,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:24:50,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:24:50,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:24:50,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:24:50,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:24:50,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:24:50,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:24:50,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:24:50,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:24:50,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:24:50,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:24:50,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:24:50,031 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:24:50,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:24:50,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:24:50,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:24:50,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:24:50,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:24:50,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:24:50,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:24:50,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:24:50,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:24:50,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:24:50,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:24:50,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:24:50,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:24:50,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:24:50,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:24:50,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:24:50,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:24:50,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:24:50,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:24:50,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:24:50,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:24:50,055 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 01:24:50,082 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:24:50,082 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:24:50,086 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:24:50,086 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:24:50,087 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:24:50,087 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:24:50,087 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:24:50,087 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:24:50,087 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:24:50,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:24:50,088 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:24:50,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:24:50,088 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:24:50,088 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:24:50,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:24:50,089 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:24:50,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:24:50,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:24:50,090 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:24:50,091 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:24:50,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:24:50,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:24:50,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:24:50,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:24:50,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:24:50,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:24:50,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:24:50,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:24:50,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:24:50,372 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:24:50,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:24:50,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:24:50,392 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:24:50,393 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:24:50,394 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010_tso.oepc.i [2019-12-27 01:24:50,468 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7daf6c352/76e9cd91dc0944f7a3fd423d4170b108/FLAG0b07aab76 [2019-12-27 01:24:51,001 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:24:51,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010_tso.oepc.i [2019-12-27 01:24:51,021 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7daf6c352/76e9cd91dc0944f7a3fd423d4170b108/FLAG0b07aab76 [2019-12-27 01:24:51,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7daf6c352/76e9cd91dc0944f7a3fd423d4170b108 [2019-12-27 01:24:51,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:24:51,293 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:24:51,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:24:51,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:24:51,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:24:51,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:24:51" (1/1) ... [2019-12-27 01:24:51,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8a5782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:51, skipping insertion in model container [2019-12-27 01:24:51,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:24:51" (1/1) ... [2019-12-27 01:24:51,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:24:51,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:24:51,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:24:51,869 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:24:51,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:24:52,030 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:24:52,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:52 WrapperNode [2019-12-27 01:24:52,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:24:52,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:24:52,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:24:52,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:24:52,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:52" (1/1) ... [2019-12-27 01:24:52,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:52" (1/1) ... [2019-12-27 01:24:52,096 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:24:52,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:24:52,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:24:52,097 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:24:52,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:52" (1/1) ... [2019-12-27 01:24:52,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:52" (1/1) ... [2019-12-27 01:24:52,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:52" (1/1) ... [2019-12-27 01:24:52,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:52" (1/1) ... [2019-12-27 01:24:52,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:52" (1/1) ... [2019-12-27 01:24:52,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:52" (1/1) ... [2019-12-27 01:24:52,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:52" (1/1) ... [2019-12-27 01:24:52,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:24:52,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:24:52,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:24:52,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:24:52,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:24:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:24:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:24:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:24:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:24:52,208 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:24:52,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:24:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:24:52,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:24:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:24:52,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:24:52,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:24:52,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:24:52,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:24:52,212 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:24:52,954 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:24:52,955 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:24:52,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:24:52 BoogieIcfgContainer [2019-12-27 01:24:52,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:24:52,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:24:52,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:24:52,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:24:52,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:24:51" (1/3) ... [2019-12-27 01:24:52,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44567451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:24:52, skipping insertion in model container [2019-12-27 01:24:52,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:24:52" (2/3) ... [2019-12-27 01:24:52,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44567451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:24:52, skipping insertion in model container [2019-12-27 01:24:52,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:24:52" (3/3) ... [2019-12-27 01:24:52,965 INFO L109 eAbstractionObserver]: Analyzing ICFG mix010_tso.oepc.i [2019-12-27 01:24:52,975 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:24:52,975 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:24:52,983 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:24:52,984 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:24:53,025 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,026 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,026 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,026 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,026 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,045 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,045 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,057 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,057 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,073 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,073 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,103 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,104 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,105 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,106 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,107 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,108 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,109 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,110 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,113 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,114 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,114 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,115 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,116 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,117 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,117 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,118 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,119 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,120 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,126 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,126 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,127 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,129 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,130 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:24:53,152 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:24:53,176 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:24:53,176 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:24:53,177 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:24:53,177 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:24:53,177 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:24:53,177 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:24:53,177 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:24:53,177 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:24:53,193 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 01:24:53,195 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 01:24:53,299 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 01:24:53,300 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:24:53,315 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:24:53,337 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 01:24:53,394 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 01:24:53,395 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:24:53,404 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 01:24:53,425 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 01:24:53,426 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:24:58,379 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-27 01:24:58,690 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 01:24:58,828 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 01:24:58,861 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91218 [2019-12-27 01:24:58,861 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 01:24:58,865 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 105 transitions [2019-12-27 01:25:19,894 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-27 01:25:19,896 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-27 01:25:19,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 01:25:19,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:19,903 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 01:25:19,903 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:25:19,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:19,910 INFO L82 PathProgramCache]: Analyzing trace with hash 921826, now seen corresponding path program 1 times [2019-12-27 01:25:19,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:19,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720620697] [2019-12-27 01:25:19,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:20,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:20,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720620697] [2019-12-27 01:25:20,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:20,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:25:20,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035017878] [2019-12-27 01:25:20,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:25:20,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:20,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:25:20,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:25:20,153 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-27 01:25:21,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:21,946 INFO L93 Difference]: Finished difference Result 125226 states and 534182 transitions. [2019-12-27 01:25:21,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:25:21,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 01:25:21,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:22,681 INFO L225 Difference]: With dead ends: 125226 [2019-12-27 01:25:22,681 INFO L226 Difference]: Without dead ends: 117946 [2019-12-27 01:25:22,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:25:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117946 states. [2019-12-27 01:25:33,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117946 to 117946. [2019-12-27 01:25:33,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117946 states. [2019-12-27 01:25:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117946 states to 117946 states and 502500 transitions. [2019-12-27 01:25:34,465 INFO L78 Accepts]: Start accepts. Automaton has 117946 states and 502500 transitions. Word has length 3 [2019-12-27 01:25:34,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:34,465 INFO L462 AbstractCegarLoop]: Abstraction has 117946 states and 502500 transitions. [2019-12-27 01:25:34,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:25:34,466 INFO L276 IsEmpty]: Start isEmpty. Operand 117946 states and 502500 transitions. [2019-12-27 01:25:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 01:25:34,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:34,470 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:25:34,471 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:25:34,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:34,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2034548154, now seen corresponding path program 1 times [2019-12-27 01:25:34,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:34,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940796416] [2019-12-27 01:25:34,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:34,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940796416] [2019-12-27 01:25:34,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:34,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:25:34,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455600844] [2019-12-27 01:25:34,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:25:34,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:34,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:25:34,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:25:34,582 INFO L87 Difference]: Start difference. First operand 117946 states and 502500 transitions. Second operand 4 states. [2019-12-27 01:25:39,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:39,602 INFO L93 Difference]: Finished difference Result 183040 states and 750092 transitions. [2019-12-27 01:25:39,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:25:39,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 01:25:39,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:40,300 INFO L225 Difference]: With dead ends: 183040 [2019-12-27 01:25:40,301 INFO L226 Difference]: Without dead ends: 182991 [2019-12-27 01:25:40,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:25:51,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182991 states. [2019-12-27 01:25:55,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182991 to 168271. [2019-12-27 01:25:55,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168271 states. [2019-12-27 01:25:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168271 states to 168271 states and 697811 transitions. [2019-12-27 01:25:56,135 INFO L78 Accepts]: Start accepts. Automaton has 168271 states and 697811 transitions. Word has length 11 [2019-12-27 01:25:56,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:25:56,135 INFO L462 AbstractCegarLoop]: Abstraction has 168271 states and 697811 transitions. [2019-12-27 01:25:56,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:25:56,135 INFO L276 IsEmpty]: Start isEmpty. Operand 168271 states and 697811 transitions. [2019-12-27 01:25:56,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:25:56,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:25:56,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:25:56,142 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:25:56,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:25:56,143 INFO L82 PathProgramCache]: Analyzing trace with hash -579003435, now seen corresponding path program 1 times [2019-12-27 01:25:56,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:25:56,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210818821] [2019-12-27 01:25:56,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:25:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:25:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:25:56,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210818821] [2019-12-27 01:25:56,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:25:56,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:25:56,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857581346] [2019-12-27 01:25:56,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:25:56,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:25:56,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:25:56,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:25:56,242 INFO L87 Difference]: Start difference. First operand 168271 states and 697811 transitions. Second operand 3 states. [2019-12-27 01:25:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:25:56,377 INFO L93 Difference]: Finished difference Result 35531 states and 115505 transitions. [2019-12-27 01:25:56,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:25:56,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:25:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:25:56,448 INFO L225 Difference]: With dead ends: 35531 [2019-12-27 01:25:56,448 INFO L226 Difference]: Without dead ends: 35531 [2019-12-27 01:25:56,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:26:02,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35531 states. [2019-12-27 01:26:02,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35531 to 35531. [2019-12-27 01:26:02,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35531 states. [2019-12-27 01:26:02,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35531 states to 35531 states and 115505 transitions. [2019-12-27 01:26:02,496 INFO L78 Accepts]: Start accepts. Automaton has 35531 states and 115505 transitions. Word has length 13 [2019-12-27 01:26:02,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:02,496 INFO L462 AbstractCegarLoop]: Abstraction has 35531 states and 115505 transitions. [2019-12-27 01:26:02,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:26:02,497 INFO L276 IsEmpty]: Start isEmpty. Operand 35531 states and 115505 transitions. [2019-12-27 01:26:02,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 01:26:02,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:02,500 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:02,500 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:02,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:02,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1458626840, now seen corresponding path program 1 times [2019-12-27 01:26:02,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:02,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852786821] [2019-12-27 01:26:02,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:02,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:02,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852786821] [2019-12-27 01:26:02,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:02,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:26:02,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245924436] [2019-12-27 01:26:02,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:26:02,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:02,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:26:02,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:26:02,583 INFO L87 Difference]: Start difference. First operand 35531 states and 115505 transitions. Second operand 5 states. [2019-12-27 01:26:03,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:03,102 INFO L93 Difference]: Finished difference Result 49606 states and 159424 transitions. [2019-12-27 01:26:03,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:26:03,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 01:26:03,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:03,201 INFO L225 Difference]: With dead ends: 49606 [2019-12-27 01:26:03,201 INFO L226 Difference]: Without dead ends: 49606 [2019-12-27 01:26:03,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:26:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49606 states. [2019-12-27 01:26:03,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49606 to 42335. [2019-12-27 01:26:03,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42335 states. [2019-12-27 01:26:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42335 states to 42335 states and 137188 transitions. [2019-12-27 01:26:04,594 INFO L78 Accepts]: Start accepts. Automaton has 42335 states and 137188 transitions. Word has length 16 [2019-12-27 01:26:04,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:04,595 INFO L462 AbstractCegarLoop]: Abstraction has 42335 states and 137188 transitions. [2019-12-27 01:26:04,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:26:04,595 INFO L276 IsEmpty]: Start isEmpty. Operand 42335 states and 137188 transitions. [2019-12-27 01:26:04,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:26:04,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:04,606 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:04,606 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:04,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:04,606 INFO L82 PathProgramCache]: Analyzing trace with hash -311730194, now seen corresponding path program 1 times [2019-12-27 01:26:04,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:04,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642163839] [2019-12-27 01:26:04,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:04,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:04,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642163839] [2019-12-27 01:26:04,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:04,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:26:04,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651124485] [2019-12-27 01:26:04,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:26:04,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:04,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:26:04,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:26:04,768 INFO L87 Difference]: Start difference. First operand 42335 states and 137188 transitions. Second operand 7 states. [2019-12-27 01:26:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:05,746 INFO L93 Difference]: Finished difference Result 68217 states and 214442 transitions. [2019-12-27 01:26:05,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 01:26:05,747 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 01:26:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:05,860 INFO L225 Difference]: With dead ends: 68217 [2019-12-27 01:26:05,860 INFO L226 Difference]: Without dead ends: 68203 [2019-12-27 01:26:05,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:26:06,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68203 states. [2019-12-27 01:26:06,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68203 to 42009. [2019-12-27 01:26:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42009 states. [2019-12-27 01:26:06,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42009 states to 42009 states and 135594 transitions. [2019-12-27 01:26:06,783 INFO L78 Accepts]: Start accepts. Automaton has 42009 states and 135594 transitions. Word has length 22 [2019-12-27 01:26:06,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:06,783 INFO L462 AbstractCegarLoop]: Abstraction has 42009 states and 135594 transitions. [2019-12-27 01:26:06,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:26:06,784 INFO L276 IsEmpty]: Start isEmpty. Operand 42009 states and 135594 transitions. [2019-12-27 01:26:06,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:26:06,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:06,799 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:06,799 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:06,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:06,800 INFO L82 PathProgramCache]: Analyzing trace with hash 573582081, now seen corresponding path program 1 times [2019-12-27 01:26:06,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:06,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549825243] [2019-12-27 01:26:06,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:06,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549825243] [2019-12-27 01:26:06,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:06,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:26:06,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060794470] [2019-12-27 01:26:06,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:26:06,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:06,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:26:06,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:26:06,858 INFO L87 Difference]: Start difference. First operand 42009 states and 135594 transitions. Second operand 4 states. [2019-12-27 01:26:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:06,938 INFO L93 Difference]: Finished difference Result 16636 states and 50803 transitions. [2019-12-27 01:26:06,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:26:06,938 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:26:06,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:06,962 INFO L225 Difference]: With dead ends: 16636 [2019-12-27 01:26:06,963 INFO L226 Difference]: Without dead ends: 16636 [2019-12-27 01:26:06,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:26:07,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16636 states. [2019-12-27 01:26:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16636 to 16378. [2019-12-27 01:26:07,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16378 states. [2019-12-27 01:26:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16378 states to 16378 states and 50067 transitions. [2019-12-27 01:26:07,576 INFO L78 Accepts]: Start accepts. Automaton has 16378 states and 50067 transitions. Word has length 25 [2019-12-27 01:26:07,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:07,577 INFO L462 AbstractCegarLoop]: Abstraction has 16378 states and 50067 transitions. [2019-12-27 01:26:07,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:26:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 16378 states and 50067 transitions. [2019-12-27 01:26:07,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 01:26:07,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:07,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:07,589 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:07,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:07,589 INFO L82 PathProgramCache]: Analyzing trace with hash 574668024, now seen corresponding path program 1 times [2019-12-27 01:26:07,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:07,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775198494] [2019-12-27 01:26:07,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:07,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:07,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775198494] [2019-12-27 01:26:07,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:07,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:26:07,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021393789] [2019-12-27 01:26:07,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:26:07,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:07,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:26:07,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:26:07,732 INFO L87 Difference]: Start difference. First operand 16378 states and 50067 transitions. Second operand 6 states. [2019-12-27 01:26:08,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:08,247 INFO L93 Difference]: Finished difference Result 23754 states and 70239 transitions. [2019-12-27 01:26:08,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 01:26:08,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 01:26:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:08,278 INFO L225 Difference]: With dead ends: 23754 [2019-12-27 01:26:08,279 INFO L226 Difference]: Without dead ends: 23754 [2019-12-27 01:26:08,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:26:08,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23754 states. [2019-12-27 01:26:08,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23754 to 19127. [2019-12-27 01:26:08,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19127 states. [2019-12-27 01:26:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19127 states to 19127 states and 57723 transitions. [2019-12-27 01:26:08,580 INFO L78 Accepts]: Start accepts. Automaton has 19127 states and 57723 transitions. Word has length 27 [2019-12-27 01:26:08,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:08,580 INFO L462 AbstractCegarLoop]: Abstraction has 19127 states and 57723 transitions. [2019-12-27 01:26:08,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:26:08,580 INFO L276 IsEmpty]: Start isEmpty. Operand 19127 states and 57723 transitions. [2019-12-27 01:26:08,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:26:08,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:08,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:08,601 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:08,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:08,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1393723506, now seen corresponding path program 1 times [2019-12-27 01:26:08,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:08,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656072096] [2019-12-27 01:26:08,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:08,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656072096] [2019-12-27 01:26:08,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:08,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:26:08,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095524367] [2019-12-27 01:26:08,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:26:08,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:08,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:26:08,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:26:08,687 INFO L87 Difference]: Start difference. First operand 19127 states and 57723 transitions. Second operand 5 states. [2019-12-27 01:26:09,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:09,048 INFO L93 Difference]: Finished difference Result 23902 states and 71215 transitions. [2019-12-27 01:26:09,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 01:26:09,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 01:26:09,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:09,080 INFO L225 Difference]: With dead ends: 23902 [2019-12-27 01:26:09,080 INFO L226 Difference]: Without dead ends: 23902 [2019-12-27 01:26:09,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:26:09,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23902 states. [2019-12-27 01:26:09,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23902 to 20179. [2019-12-27 01:26:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20179 states. [2019-12-27 01:26:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20179 states to 20179 states and 61180 transitions. [2019-12-27 01:26:09,388 INFO L78 Accepts]: Start accepts. Automaton has 20179 states and 61180 transitions. Word has length 33 [2019-12-27 01:26:09,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:09,388 INFO L462 AbstractCegarLoop]: Abstraction has 20179 states and 61180 transitions. [2019-12-27 01:26:09,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:26:09,389 INFO L276 IsEmpty]: Start isEmpty. Operand 20179 states and 61180 transitions. [2019-12-27 01:26:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 01:26:09,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:09,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:09,411 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:09,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:09,411 INFO L82 PathProgramCache]: Analyzing trace with hash 305072172, now seen corresponding path program 2 times [2019-12-27 01:26:09,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:09,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256118162] [2019-12-27 01:26:09,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:09,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256118162] [2019-12-27 01:26:09,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:09,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:26:09,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115236460] [2019-12-27 01:26:09,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:26:09,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:09,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:26:09,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:26:09,514 INFO L87 Difference]: Start difference. First operand 20179 states and 61180 transitions. Second operand 8 states. [2019-12-27 01:26:10,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:10,761 INFO L93 Difference]: Finished difference Result 27626 states and 80996 transitions. [2019-12-27 01:26:10,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 01:26:10,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 01:26:10,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:10,817 INFO L225 Difference]: With dead ends: 27626 [2019-12-27 01:26:10,818 INFO L226 Difference]: Without dead ends: 27626 [2019-12-27 01:26:10,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2019-12-27 01:26:10,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27626 states. [2019-12-27 01:26:11,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27626 to 17400. [2019-12-27 01:26:11,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17400 states. [2019-12-27 01:26:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17400 states to 17400 states and 52480 transitions. [2019-12-27 01:26:11,490 INFO L78 Accepts]: Start accepts. Automaton has 17400 states and 52480 transitions. Word has length 33 [2019-12-27 01:26:11,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:11,491 INFO L462 AbstractCegarLoop]: Abstraction has 17400 states and 52480 transitions. [2019-12-27 01:26:11,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:26:11,491 INFO L276 IsEmpty]: Start isEmpty. Operand 17400 states and 52480 transitions. [2019-12-27 01:26:11,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:26:11,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:11,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:11,511 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:11,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:11,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1779229683, now seen corresponding path program 1 times [2019-12-27 01:26:11,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:11,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288302688] [2019-12-27 01:26:11,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:11,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:11,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288302688] [2019-12-27 01:26:11,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:11,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:26:11,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773166674] [2019-12-27 01:26:11,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:26:11,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:11,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:26:11,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:26:11,579 INFO L87 Difference]: Start difference. First operand 17400 states and 52480 transitions. Second operand 3 states. [2019-12-27 01:26:11,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:11,654 INFO L93 Difference]: Finished difference Result 17399 states and 52478 transitions. [2019-12-27 01:26:11,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:26:11,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:26:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:11,694 INFO L225 Difference]: With dead ends: 17399 [2019-12-27 01:26:11,694 INFO L226 Difference]: Without dead ends: 17399 [2019-12-27 01:26:11,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:26:11,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17399 states. [2019-12-27 01:26:12,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17399 to 17399. [2019-12-27 01:26:12,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17399 states. [2019-12-27 01:26:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17399 states to 17399 states and 52478 transitions. [2019-12-27 01:26:12,079 INFO L78 Accepts]: Start accepts. Automaton has 17399 states and 52478 transitions. Word has length 39 [2019-12-27 01:26:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:12,080 INFO L462 AbstractCegarLoop]: Abstraction has 17399 states and 52478 transitions. [2019-12-27 01:26:12,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:26:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 17399 states and 52478 transitions. [2019-12-27 01:26:12,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:26:12,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:12,099 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:12,099 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:12,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:12,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1175786798, now seen corresponding path program 1 times [2019-12-27 01:26:12,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:12,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709973331] [2019-12-27 01:26:12,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:12,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709973331] [2019-12-27 01:26:12,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:12,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:26:12,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897911237] [2019-12-27 01:26:12,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 01:26:12,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:12,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 01:26:12,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:26:12,190 INFO L87 Difference]: Start difference. First operand 17399 states and 52478 transitions. Second operand 6 states. [2019-12-27 01:26:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:13,134 INFO L93 Difference]: Finished difference Result 34243 states and 103303 transitions. [2019-12-27 01:26:13,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:26:13,134 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 01:26:13,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:13,182 INFO L225 Difference]: With dead ends: 34243 [2019-12-27 01:26:13,182 INFO L226 Difference]: Without dead ends: 34243 [2019-12-27 01:26:13,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:26:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34243 states. [2019-12-27 01:26:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34243 to 22015. [2019-12-27 01:26:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22015 states. [2019-12-27 01:26:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22015 states to 22015 states and 66470 transitions. [2019-12-27 01:26:13,587 INFO L78 Accepts]: Start accepts. Automaton has 22015 states and 66470 transitions. Word has length 40 [2019-12-27 01:26:13,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:13,587 INFO L462 AbstractCegarLoop]: Abstraction has 22015 states and 66470 transitions. [2019-12-27 01:26:13,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 01:26:13,587 INFO L276 IsEmpty]: Start isEmpty. Operand 22015 states and 66470 transitions. [2019-12-27 01:26:13,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:26:13,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:13,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:13,609 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:13,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:13,610 INFO L82 PathProgramCache]: Analyzing trace with hash -93454286, now seen corresponding path program 2 times [2019-12-27 01:26:13,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:13,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999276381] [2019-12-27 01:26:13,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:13,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:13,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999276381] [2019-12-27 01:26:13,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:13,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 01:26:13,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517782259] [2019-12-27 01:26:13,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:26:13,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:13,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:26:13,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:26:13,699 INFO L87 Difference]: Start difference. First operand 22015 states and 66470 transitions. Second operand 5 states. [2019-12-27 01:26:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:14,295 INFO L93 Difference]: Finished difference Result 30046 states and 90242 transitions. [2019-12-27 01:26:14,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 01:26:14,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:26:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:14,337 INFO L225 Difference]: With dead ends: 30046 [2019-12-27 01:26:14,338 INFO L226 Difference]: Without dead ends: 30046 [2019-12-27 01:26:14,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 01:26:14,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30046 states. [2019-12-27 01:26:15,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30046 to 26807. [2019-12-27 01:26:15,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26807 states. [2019-12-27 01:26:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26807 states to 26807 states and 81221 transitions. [2019-12-27 01:26:15,085 INFO L78 Accepts]: Start accepts. Automaton has 26807 states and 81221 transitions. Word has length 40 [2019-12-27 01:26:15,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:15,085 INFO L462 AbstractCegarLoop]: Abstraction has 26807 states and 81221 transitions. [2019-12-27 01:26:15,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:26:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand 26807 states and 81221 transitions. [2019-12-27 01:26:15,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 01:26:15,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:15,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:15,119 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:15,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:15,120 INFO L82 PathProgramCache]: Analyzing trace with hash 152430908, now seen corresponding path program 3 times [2019-12-27 01:26:15,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:15,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343591326] [2019-12-27 01:26:15,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:15,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:15,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:15,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343591326] [2019-12-27 01:26:15,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:15,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:26:15,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834840382] [2019-12-27 01:26:15,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:26:15,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:15,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:26:15,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:26:15,182 INFO L87 Difference]: Start difference. First operand 26807 states and 81221 transitions. Second operand 5 states. [2019-12-27 01:26:15,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:15,306 INFO L93 Difference]: Finished difference Result 25470 states and 78136 transitions. [2019-12-27 01:26:15,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:26:15,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 01:26:15,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:15,365 INFO L225 Difference]: With dead ends: 25470 [2019-12-27 01:26:15,366 INFO L226 Difference]: Without dead ends: 25470 [2019-12-27 01:26:15,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:26:15,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25470 states. [2019-12-27 01:26:15,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25470 to 24504. [2019-12-27 01:26:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24504 states. [2019-12-27 01:26:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24504 states to 24504 states and 75530 transitions. [2019-12-27 01:26:15,944 INFO L78 Accepts]: Start accepts. Automaton has 24504 states and 75530 transitions. Word has length 40 [2019-12-27 01:26:15,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:15,944 INFO L462 AbstractCegarLoop]: Abstraction has 24504 states and 75530 transitions. [2019-12-27 01:26:15,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:26:15,945 INFO L276 IsEmpty]: Start isEmpty. Operand 24504 states and 75530 transitions. [2019-12-27 01:26:15,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:26:15,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:15,981 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:15,982 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:15,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:15,982 INFO L82 PathProgramCache]: Analyzing trace with hash 974609302, now seen corresponding path program 1 times [2019-12-27 01:26:15,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:15,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331830014] [2019-12-27 01:26:15,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:16,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331830014] [2019-12-27 01:26:16,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:16,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:26:16,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848481444] [2019-12-27 01:26:16,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:26:16,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:16,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:26:16,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:26:16,052 INFO L87 Difference]: Start difference. First operand 24504 states and 75530 transitions. Second operand 3 states. [2019-12-27 01:26:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:16,192 INFO L93 Difference]: Finished difference Result 34625 states and 106821 transitions. [2019-12-27 01:26:16,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:26:16,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:26:16,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:16,247 INFO L225 Difference]: With dead ends: 34625 [2019-12-27 01:26:16,247 INFO L226 Difference]: Without dead ends: 34625 [2019-12-27 01:26:16,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:26:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34625 states. [2019-12-27 01:26:16,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34625 to 27128. [2019-12-27 01:26:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27128 states. [2019-12-27 01:26:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27128 states to 27128 states and 84304 transitions. [2019-12-27 01:26:16,705 INFO L78 Accepts]: Start accepts. Automaton has 27128 states and 84304 transitions. Word has length 64 [2019-12-27 01:26:16,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:16,705 INFO L462 AbstractCegarLoop]: Abstraction has 27128 states and 84304 transitions. [2019-12-27 01:26:16,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:26:16,705 INFO L276 IsEmpty]: Start isEmpty. Operand 27128 states and 84304 transitions. [2019-12-27 01:26:16,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:26:16,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:16,745 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:16,745 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:16,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:16,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1487362447, now seen corresponding path program 1 times [2019-12-27 01:26:16,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:16,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971298728] [2019-12-27 01:26:16,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:16,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971298728] [2019-12-27 01:26:16,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:16,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:26:16,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550437716] [2019-12-27 01:26:16,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:26:16,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:16,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:26:16,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:26:16,844 INFO L87 Difference]: Start difference. First operand 27128 states and 84304 transitions. Second operand 7 states. [2019-12-27 01:26:17,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:17,490 INFO L93 Difference]: Finished difference Result 73273 states and 226524 transitions. [2019-12-27 01:26:17,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:26:17,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:26:17,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:17,596 INFO L225 Difference]: With dead ends: 73273 [2019-12-27 01:26:17,596 INFO L226 Difference]: Without dead ends: 55201 [2019-12-27 01:26:17,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:26:17,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55201 states. [2019-12-27 01:26:18,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55201 to 31445. [2019-12-27 01:26:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31445 states. [2019-12-27 01:26:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31445 states to 31445 states and 97708 transitions. [2019-12-27 01:26:18,638 INFO L78 Accepts]: Start accepts. Automaton has 31445 states and 97708 transitions. Word has length 64 [2019-12-27 01:26:18,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:18,638 INFO L462 AbstractCegarLoop]: Abstraction has 31445 states and 97708 transitions. [2019-12-27 01:26:18,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:26:18,638 INFO L276 IsEmpty]: Start isEmpty. Operand 31445 states and 97708 transitions. [2019-12-27 01:26:18,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:26:18,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:18,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:18,675 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:18,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:18,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1007546921, now seen corresponding path program 2 times [2019-12-27 01:26:18,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:18,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039815357] [2019-12-27 01:26:18,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:18,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:18,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039815357] [2019-12-27 01:26:18,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:18,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:26:18,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349811349] [2019-12-27 01:26:18,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:26:18,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:18,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:26:18,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:26:18,774 INFO L87 Difference]: Start difference. First operand 31445 states and 97708 transitions. Second operand 7 states. [2019-12-27 01:26:19,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:19,320 INFO L93 Difference]: Finished difference Result 81140 states and 248111 transitions. [2019-12-27 01:26:19,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:26:19,320 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 01:26:19,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:19,406 INFO L225 Difference]: With dead ends: 81140 [2019-12-27 01:26:19,407 INFO L226 Difference]: Without dead ends: 57495 [2019-12-27 01:26:19,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:26:19,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57495 states. [2019-12-27 01:26:20,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57495 to 35246. [2019-12-27 01:26:20,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35246 states. [2019-12-27 01:26:20,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35246 states to 35246 states and 109148 transitions. [2019-12-27 01:26:20,146 INFO L78 Accepts]: Start accepts. Automaton has 35246 states and 109148 transitions. Word has length 64 [2019-12-27 01:26:20,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:20,146 INFO L462 AbstractCegarLoop]: Abstraction has 35246 states and 109148 transitions. [2019-12-27 01:26:20,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:26:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand 35246 states and 109148 transitions. [2019-12-27 01:26:20,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:26:20,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:20,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:20,187 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:20,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:20,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1228276157, now seen corresponding path program 3 times [2019-12-27 01:26:20,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:20,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342358322] [2019-12-27 01:26:20,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:20,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:20,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342358322] [2019-12-27 01:26:20,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:20,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:26:20,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913550858] [2019-12-27 01:26:20,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:26:20,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:20,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:26:20,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:26:20,288 INFO L87 Difference]: Start difference. First operand 35246 states and 109148 transitions. Second operand 8 states. [2019-12-27 01:26:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:21,777 INFO L93 Difference]: Finished difference Result 98595 states and 302496 transitions. [2019-12-27 01:26:21,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 01:26:21,777 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 01:26:21,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:21,910 INFO L225 Difference]: With dead ends: 98595 [2019-12-27 01:26:21,910 INFO L226 Difference]: Without dead ends: 87943 [2019-12-27 01:26:21,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 01:26:22,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87943 states. [2019-12-27 01:26:22,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87943 to 35744. [2019-12-27 01:26:22,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35744 states. [2019-12-27 01:26:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35744 states to 35744 states and 111048 transitions. [2019-12-27 01:26:22,897 INFO L78 Accepts]: Start accepts. Automaton has 35744 states and 111048 transitions. Word has length 64 [2019-12-27 01:26:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:22,897 INFO L462 AbstractCegarLoop]: Abstraction has 35744 states and 111048 transitions. [2019-12-27 01:26:22,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:26:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 35744 states and 111048 transitions. [2019-12-27 01:26:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:26:22,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:22,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:22,935 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:22,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:22,936 INFO L82 PathProgramCache]: Analyzing trace with hash -2056816817, now seen corresponding path program 4 times [2019-12-27 01:26:22,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:22,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524829860] [2019-12-27 01:26:22,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:23,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:23,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524829860] [2019-12-27 01:26:23,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:23,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:26:23,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643241962] [2019-12-27 01:26:23,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:26:23,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:23,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:26:23,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:26:23,052 INFO L87 Difference]: Start difference. First operand 35744 states and 111048 transitions. Second operand 9 states. [2019-12-27 01:26:24,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:24,728 INFO L93 Difference]: Finished difference Result 119468 states and 363005 transitions. [2019-12-27 01:26:24,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 01:26:24,728 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:26:24,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:24,894 INFO L225 Difference]: With dead ends: 119468 [2019-12-27 01:26:24,895 INFO L226 Difference]: Without dead ends: 105156 [2019-12-27 01:26:24,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-12-27 01:26:25,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105156 states. [2019-12-27 01:26:26,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105156 to 35780. [2019-12-27 01:26:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35780 states. [2019-12-27 01:26:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35780 states to 35780 states and 111205 transitions. [2019-12-27 01:26:26,467 INFO L78 Accepts]: Start accepts. Automaton has 35780 states and 111205 transitions. Word has length 64 [2019-12-27 01:26:26,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:26,468 INFO L462 AbstractCegarLoop]: Abstraction has 35780 states and 111205 transitions. [2019-12-27 01:26:26,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:26:26,468 INFO L276 IsEmpty]: Start isEmpty. Operand 35780 states and 111205 transitions. [2019-12-27 01:26:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:26:26,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:26,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:26,507 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:26,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:26,507 INFO L82 PathProgramCache]: Analyzing trace with hash 836129701, now seen corresponding path program 5 times [2019-12-27 01:26:26,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:26,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170658491] [2019-12-27 01:26:26,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:26,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:26,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170658491] [2019-12-27 01:26:26,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:26,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:26:26,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639198222] [2019-12-27 01:26:26,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:26:26,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:26,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:26:26,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:26:26,637 INFO L87 Difference]: Start difference. First operand 35780 states and 111205 transitions. Second operand 9 states. [2019-12-27 01:26:28,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:28,204 INFO L93 Difference]: Finished difference Result 131669 states and 399951 transitions. [2019-12-27 01:26:28,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 01:26:28,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 01:26:28,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:28,394 INFO L225 Difference]: With dead ends: 131669 [2019-12-27 01:26:28,394 INFO L226 Difference]: Without dead ends: 121803 [2019-12-27 01:26:28,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2019-12-27 01:26:28,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121803 states. [2019-12-27 01:26:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121803 to 35817. [2019-12-27 01:26:30,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35817 states. [2019-12-27 01:26:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35817 states to 35817 states and 111367 transitions. [2019-12-27 01:26:30,135 INFO L78 Accepts]: Start accepts. Automaton has 35817 states and 111367 transitions. Word has length 64 [2019-12-27 01:26:30,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:30,135 INFO L462 AbstractCegarLoop]: Abstraction has 35817 states and 111367 transitions. [2019-12-27 01:26:30,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:26:30,135 INFO L276 IsEmpty]: Start isEmpty. Operand 35817 states and 111367 transitions. [2019-12-27 01:26:30,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 01:26:30,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:30,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:30,174 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:30,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:30,174 INFO L82 PathProgramCache]: Analyzing trace with hash -17789391, now seen corresponding path program 6 times [2019-12-27 01:26:30,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:30,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427360367] [2019-12-27 01:26:30,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:30,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427360367] [2019-12-27 01:26:30,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:30,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:26:30,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515315218] [2019-12-27 01:26:30,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:26:30,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:30,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:26:30,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:26:30,231 INFO L87 Difference]: Start difference. First operand 35817 states and 111367 transitions. Second operand 3 states. [2019-12-27 01:26:30,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:30,428 INFO L93 Difference]: Finished difference Result 42547 states and 131537 transitions. [2019-12-27 01:26:30,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:26:30,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 01:26:30,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:30,486 INFO L225 Difference]: With dead ends: 42547 [2019-12-27 01:26:30,486 INFO L226 Difference]: Without dead ends: 42547 [2019-12-27 01:26:30,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:26:30,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42547 states. [2019-12-27 01:26:31,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42547 to 37071. [2019-12-27 01:26:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37071 states. [2019-12-27 01:26:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37071 states to 37071 states and 115326 transitions. [2019-12-27 01:26:31,080 INFO L78 Accepts]: Start accepts. Automaton has 37071 states and 115326 transitions. Word has length 64 [2019-12-27 01:26:31,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:31,080 INFO L462 AbstractCegarLoop]: Abstraction has 37071 states and 115326 transitions. [2019-12-27 01:26:31,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:26:31,080 INFO L276 IsEmpty]: Start isEmpty. Operand 37071 states and 115326 transitions. [2019-12-27 01:26:31,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:26:31,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:31,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:31,120 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:31,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:31,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1046831716, now seen corresponding path program 1 times [2019-12-27 01:26:31,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:31,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867976710] [2019-12-27 01:26:31,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:31,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:31,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867976710] [2019-12-27 01:26:31,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:31,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:26:31,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781902957] [2019-12-27 01:26:31,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:26:31,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:31,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:26:31,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:26:31,223 INFO L87 Difference]: Start difference. First operand 37071 states and 115326 transitions. Second operand 8 states. [2019-12-27 01:26:32,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:32,495 INFO L93 Difference]: Finished difference Result 111740 states and 339408 transitions. [2019-12-27 01:26:32,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 01:26:32,495 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 01:26:32,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:32,650 INFO L225 Difference]: With dead ends: 111740 [2019-12-27 01:26:32,650 INFO L226 Difference]: Without dead ends: 99733 [2019-12-27 01:26:32,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 01:26:33,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99733 states. [2019-12-27 01:26:34,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99733 to 37073. [2019-12-27 01:26:34,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37073 states. [2019-12-27 01:26:34,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37073 states to 37073 states and 115341 transitions. [2019-12-27 01:26:34,153 INFO L78 Accepts]: Start accepts. Automaton has 37073 states and 115341 transitions. Word has length 65 [2019-12-27 01:26:34,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:34,154 INFO L462 AbstractCegarLoop]: Abstraction has 37073 states and 115341 transitions. [2019-12-27 01:26:34,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:26:34,154 INFO L276 IsEmpty]: Start isEmpty. Operand 37073 states and 115341 transitions. [2019-12-27 01:26:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:26:34,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:34,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:34,196 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:34,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:34,196 INFO L82 PathProgramCache]: Analyzing trace with hash 501635668, now seen corresponding path program 2 times [2019-12-27 01:26:34,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:34,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091432014] [2019-12-27 01:26:34,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:34,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:34,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091432014] [2019-12-27 01:26:34,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:34,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:26:34,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994692503] [2019-12-27 01:26:34,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:26:34,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:34,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:26:34,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:26:34,310 INFO L87 Difference]: Start difference. First operand 37073 states and 115341 transitions. Second operand 9 states. [2019-12-27 01:26:36,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:36,029 INFO L93 Difference]: Finished difference Result 134194 states and 407074 transitions. [2019-12-27 01:26:36,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:26:36,030 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 01:26:36,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:36,219 INFO L225 Difference]: With dead ends: 134194 [2019-12-27 01:26:36,219 INFO L226 Difference]: Without dead ends: 122325 [2019-12-27 01:26:36,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-12-27 01:26:36,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122325 states. [2019-12-27 01:26:37,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122325 to 37029. [2019-12-27 01:26:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37029 states. [2019-12-27 01:26:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37029 states to 37029 states and 115116 transitions. [2019-12-27 01:26:37,954 INFO L78 Accepts]: Start accepts. Automaton has 37029 states and 115116 transitions. Word has length 65 [2019-12-27 01:26:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:37,954 INFO L462 AbstractCegarLoop]: Abstraction has 37029 states and 115116 transitions. [2019-12-27 01:26:37,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:26:37,954 INFO L276 IsEmpty]: Start isEmpty. Operand 37029 states and 115116 transitions. [2019-12-27 01:26:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:26:37,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:37,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:37,992 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:37,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:37,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1293437306, now seen corresponding path program 3 times [2019-12-27 01:26:37,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:37,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828890351] [2019-12-27 01:26:37,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:38,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828890351] [2019-12-27 01:26:38,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:38,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:26:38,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554544943] [2019-12-27 01:26:38,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:26:38,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:38,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:26:38,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:26:38,094 INFO L87 Difference]: Start difference. First operand 37029 states and 115116 transitions. Second operand 9 states. [2019-12-27 01:26:39,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:39,987 INFO L93 Difference]: Finished difference Result 153077 states and 465403 transitions. [2019-12-27 01:26:39,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 01:26:39,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 01:26:39,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:40,185 INFO L225 Difference]: With dead ends: 153077 [2019-12-27 01:26:40,185 INFO L226 Difference]: Without dead ends: 125434 [2019-12-27 01:26:40,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2019-12-27 01:26:40,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125434 states. [2019-12-27 01:26:42,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125434 to 40153. [2019-12-27 01:26:42,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40153 states. [2019-12-27 01:26:42,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40153 states to 40153 states and 125039 transitions. [2019-12-27 01:26:42,087 INFO L78 Accepts]: Start accepts. Automaton has 40153 states and 125039 transitions. Word has length 65 [2019-12-27 01:26:42,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:42,087 INFO L462 AbstractCegarLoop]: Abstraction has 40153 states and 125039 transitions. [2019-12-27 01:26:42,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:26:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 40153 states and 125039 transitions. [2019-12-27 01:26:42,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:26:42,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:42,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:42,135 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:42,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:42,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1980366454, now seen corresponding path program 4 times [2019-12-27 01:26:42,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:42,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124080519] [2019-12-27 01:26:42,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:42,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124080519] [2019-12-27 01:26:42,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:42,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 01:26:42,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409328008] [2019-12-27 01:26:42,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:26:42,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:42,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:26:42,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:26:42,225 INFO L87 Difference]: Start difference. First operand 40153 states and 125039 transitions. Second operand 7 states. [2019-12-27 01:26:43,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:43,278 INFO L93 Difference]: Finished difference Result 55596 states and 169227 transitions. [2019-12-27 01:26:43,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 01:26:43,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 01:26:43,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:43,362 INFO L225 Difference]: With dead ends: 55596 [2019-12-27 01:26:43,362 INFO L226 Difference]: Without dead ends: 55596 [2019-12-27 01:26:43,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-27 01:26:43,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55596 states. [2019-12-27 01:26:44,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55596 to 42525. [2019-12-27 01:26:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42525 states. [2019-12-27 01:26:44,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42525 states to 42525 states and 131689 transitions. [2019-12-27 01:26:44,108 INFO L78 Accepts]: Start accepts. Automaton has 42525 states and 131689 transitions. Word has length 65 [2019-12-27 01:26:44,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:44,108 INFO L462 AbstractCegarLoop]: Abstraction has 42525 states and 131689 transitions. [2019-12-27 01:26:44,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:26:44,108 INFO L276 IsEmpty]: Start isEmpty. Operand 42525 states and 131689 transitions. [2019-12-27 01:26:44,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:26:44,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:44,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:44,156 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:44,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:44,157 INFO L82 PathProgramCache]: Analyzing trace with hash -25014344, now seen corresponding path program 5 times [2019-12-27 01:26:44,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:44,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446500709] [2019-12-27 01:26:44,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:44,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:44,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446500709] [2019-12-27 01:26:44,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:44,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:26:44,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358261604] [2019-12-27 01:26:44,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:26:44,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:44,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:26:44,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:26:44,273 INFO L87 Difference]: Start difference. First operand 42525 states and 131689 transitions. Second operand 9 states. [2019-12-27 01:26:46,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:46,331 INFO L93 Difference]: Finished difference Result 66164 states and 202890 transitions. [2019-12-27 01:26:46,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 01:26:46,332 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 01:26:46,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:46,433 INFO L225 Difference]: With dead ends: 66164 [2019-12-27 01:26:46,434 INFO L226 Difference]: Without dead ends: 66164 [2019-12-27 01:26:46,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2019-12-27 01:26:46,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66164 states. [2019-12-27 01:26:47,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66164 to 41944. [2019-12-27 01:26:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41944 states. [2019-12-27 01:26:47,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41944 states to 41944 states and 130085 transitions. [2019-12-27 01:26:47,671 INFO L78 Accepts]: Start accepts. Automaton has 41944 states and 130085 transitions. Word has length 65 [2019-12-27 01:26:47,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:47,672 INFO L462 AbstractCegarLoop]: Abstraction has 41944 states and 130085 transitions. [2019-12-27 01:26:47,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:26:47,672 INFO L276 IsEmpty]: Start isEmpty. Operand 41944 states and 130085 transitions. [2019-12-27 01:26:47,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:26:47,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:47,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:47,718 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:47,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:47,719 INFO L82 PathProgramCache]: Analyzing trace with hash 373916454, now seen corresponding path program 1 times [2019-12-27 01:26:47,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:47,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098822197] [2019-12-27 01:26:47,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:47,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098822197] [2019-12-27 01:26:47,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:47,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:26:47,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360655020] [2019-12-27 01:26:47,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:26:47,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:47,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:26:47,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:26:47,842 INFO L87 Difference]: Start difference. First operand 41944 states and 130085 transitions. Second operand 8 states. [2019-12-27 01:26:49,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:49,429 INFO L93 Difference]: Finished difference Result 55795 states and 168786 transitions. [2019-12-27 01:26:49,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 01:26:49,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 01:26:49,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:49,513 INFO L225 Difference]: With dead ends: 55795 [2019-12-27 01:26:49,513 INFO L226 Difference]: Without dead ends: 55795 [2019-12-27 01:26:49,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-12-27 01:26:49,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55795 states. [2019-12-27 01:26:50,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55795 to 43437. [2019-12-27 01:26:50,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43437 states. [2019-12-27 01:26:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43437 states to 43437 states and 134338 transitions. [2019-12-27 01:26:50,284 INFO L78 Accepts]: Start accepts. Automaton has 43437 states and 134338 transitions. Word has length 65 [2019-12-27 01:26:50,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:50,284 INFO L462 AbstractCegarLoop]: Abstraction has 43437 states and 134338 transitions. [2019-12-27 01:26:50,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:26:50,284 INFO L276 IsEmpty]: Start isEmpty. Operand 43437 states and 134338 transitions. [2019-12-27 01:26:50,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:26:50,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:50,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:50,333 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:50,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1193547640, now seen corresponding path program 2 times [2019-12-27 01:26:50,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:50,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570864042] [2019-12-27 01:26:50,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:50,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:50,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570864042] [2019-12-27 01:26:50,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:50,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:26:50,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274024022] [2019-12-27 01:26:50,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:26:50,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:50,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:26:50,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:26:50,503 INFO L87 Difference]: Start difference. First operand 43437 states and 134338 transitions. Second operand 9 states. [2019-12-27 01:26:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:52,111 INFO L93 Difference]: Finished difference Result 66620 states and 204092 transitions. [2019-12-27 01:26:52,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 01:26:52,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 01:26:52,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:52,211 INFO L225 Difference]: With dead ends: 66620 [2019-12-27 01:26:52,211 INFO L226 Difference]: Without dead ends: 66620 [2019-12-27 01:26:52,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:26:52,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66620 states. [2019-12-27 01:26:52,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66620 to 43912. [2019-12-27 01:26:52,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43912 states. [2019-12-27 01:26:53,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43912 states to 43912 states and 136009 transitions. [2019-12-27 01:26:53,066 INFO L78 Accepts]: Start accepts. Automaton has 43912 states and 136009 transitions. Word has length 65 [2019-12-27 01:26:53,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:53,066 INFO L462 AbstractCegarLoop]: Abstraction has 43912 states and 136009 transitions. [2019-12-27 01:26:53,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:26:53,066 INFO L276 IsEmpty]: Start isEmpty. Operand 43912 states and 136009 transitions. [2019-12-27 01:26:53,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:26:53,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:53,114 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:53,114 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:53,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:53,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1646807062, now seen corresponding path program 3 times [2019-12-27 01:26:53,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:53,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970487436] [2019-12-27 01:26:53,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:53,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970487436] [2019-12-27 01:26:53,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:53,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 01:26:53,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705578124] [2019-12-27 01:26:53,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:26:53,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:53,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:26:53,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:26:53,325 INFO L87 Difference]: Start difference. First operand 43912 states and 136009 transitions. Second operand 12 states. [2019-12-27 01:26:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:56,367 INFO L93 Difference]: Finished difference Result 69930 states and 212959 transitions. [2019-12-27 01:26:56,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 01:26:56,368 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 01:26:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:56,478 INFO L225 Difference]: With dead ends: 69930 [2019-12-27 01:26:56,478 INFO L226 Difference]: Without dead ends: 69930 [2019-12-27 01:26:56,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=1152, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 01:26:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69930 states. [2019-12-27 01:26:57,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69930 to 43871. [2019-12-27 01:26:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43871 states. [2019-12-27 01:26:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43871 states to 43871 states and 135672 transitions. [2019-12-27 01:26:57,821 INFO L78 Accepts]: Start accepts. Automaton has 43871 states and 135672 transitions. Word has length 65 [2019-12-27 01:26:57,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:57,821 INFO L462 AbstractCegarLoop]: Abstraction has 43871 states and 135672 transitions. [2019-12-27 01:26:57,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:26:57,821 INFO L276 IsEmpty]: Start isEmpty. Operand 43871 states and 135672 transitions. [2019-12-27 01:26:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:26:57,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:57,867 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:57,867 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:57,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:57,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1702799038, now seen corresponding path program 6 times [2019-12-27 01:26:57,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:57,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844813308] [2019-12-27 01:26:57,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:57,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:57,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844813308] [2019-12-27 01:26:57,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:57,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:26:57,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006110056] [2019-12-27 01:26:57,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:26:57,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:57,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:26:57,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:26:57,931 INFO L87 Difference]: Start difference. First operand 43871 states and 135672 transitions. Second operand 4 states. [2019-12-27 01:26:58,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:58,216 INFO L93 Difference]: Finished difference Result 43871 states and 135384 transitions. [2019-12-27 01:26:58,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:26:58,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 01:26:58,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:58,328 INFO L225 Difference]: With dead ends: 43871 [2019-12-27 01:26:58,329 INFO L226 Difference]: Without dead ends: 43871 [2019-12-27 01:26:58,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:26:58,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43871 states. [2019-12-27 01:26:59,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43871 to 41705. [2019-12-27 01:26:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41705 states. [2019-12-27 01:26:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41705 states to 41705 states and 128993 transitions. [2019-12-27 01:26:59,339 INFO L78 Accepts]: Start accepts. Automaton has 41705 states and 128993 transitions. Word has length 65 [2019-12-27 01:26:59,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:26:59,339 INFO L462 AbstractCegarLoop]: Abstraction has 41705 states and 128993 transitions. [2019-12-27 01:26:59,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:26:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 41705 states and 128993 transitions. [2019-12-27 01:26:59,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 01:26:59,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:26:59,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:26:59,387 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:26:59,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:26:59,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1521961444, now seen corresponding path program 4 times [2019-12-27 01:26:59,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:26:59,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194210755] [2019-12-27 01:26:59,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:26:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:26:59,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:26:59,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194210755] [2019-12-27 01:26:59,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:26:59,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:26:59,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086361660] [2019-12-27 01:26:59,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:26:59,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:26:59,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:26:59,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:26:59,449 INFO L87 Difference]: Start difference. First operand 41705 states and 128993 transitions. Second operand 3 states. [2019-12-27 01:26:59,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:26:59,646 INFO L93 Difference]: Finished difference Result 41704 states and 128991 transitions. [2019-12-27 01:26:59,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:26:59,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 01:26:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:26:59,755 INFO L225 Difference]: With dead ends: 41704 [2019-12-27 01:26:59,755 INFO L226 Difference]: Without dead ends: 41704 [2019-12-27 01:26:59,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:00,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41704 states. [2019-12-27 01:27:01,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41704 to 29811. [2019-12-27 01:27:01,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29811 states. [2019-12-27 01:27:01,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29811 states to 29811 states and 95272 transitions. [2019-12-27 01:27:01,456 INFO L78 Accepts]: Start accepts. Automaton has 29811 states and 95272 transitions. Word has length 65 [2019-12-27 01:27:01,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:01,457 INFO L462 AbstractCegarLoop]: Abstraction has 29811 states and 95272 transitions. [2019-12-27 01:27:01,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:01,457 INFO L276 IsEmpty]: Start isEmpty. Operand 29811 states and 95272 transitions. [2019-12-27 01:27:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 01:27:01,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:01,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:01,509 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:01,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:01,510 INFO L82 PathProgramCache]: Analyzing trace with hash 392067852, now seen corresponding path program 1 times [2019-12-27 01:27:01,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:01,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525354641] [2019-12-27 01:27:01,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:01,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:01,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525354641] [2019-12-27 01:27:01,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:01,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:27:01,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111366681] [2019-12-27 01:27:01,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:27:01,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:01,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:27:01,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:01,628 INFO L87 Difference]: Start difference. First operand 29811 states and 95272 transitions. Second operand 3 states. [2019-12-27 01:27:01,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:01,756 INFO L93 Difference]: Finished difference Result 24056 states and 75514 transitions. [2019-12-27 01:27:01,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:27:01,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 01:27:01,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:01,802 INFO L225 Difference]: With dead ends: 24056 [2019-12-27 01:27:01,802 INFO L226 Difference]: Without dead ends: 24056 [2019-12-27 01:27:01,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:27:01,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24056 states. [2019-12-27 01:27:02,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24056 to 22094. [2019-12-27 01:27:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22094 states. [2019-12-27 01:27:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22094 states to 22094 states and 69094 transitions. [2019-12-27 01:27:02,286 INFO L78 Accepts]: Start accepts. Automaton has 22094 states and 69094 transitions. Word has length 66 [2019-12-27 01:27:02,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:02,287 INFO L462 AbstractCegarLoop]: Abstraction has 22094 states and 69094 transitions. [2019-12-27 01:27:02,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:27:02,287 INFO L276 IsEmpty]: Start isEmpty. Operand 22094 states and 69094 transitions. [2019-12-27 01:27:02,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:27:02,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:02,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:02,316 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:02,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:02,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2062742571, now seen corresponding path program 1 times [2019-12-27 01:27:02,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:02,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236835528] [2019-12-27 01:27:02,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:02,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236835528] [2019-12-27 01:27:02,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:02,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:27:02,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925780321] [2019-12-27 01:27:02,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:27:02,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:02,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:27:02,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:27:02,418 INFO L87 Difference]: Start difference. First operand 22094 states and 69094 transitions. Second operand 9 states. [2019-12-27 01:27:04,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:04,107 INFO L93 Difference]: Finished difference Result 42939 states and 132861 transitions. [2019-12-27 01:27:04,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 01:27:04,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-27 01:27:04,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:04,158 INFO L225 Difference]: With dead ends: 42939 [2019-12-27 01:27:04,158 INFO L226 Difference]: Without dead ends: 35065 [2019-12-27 01:27:04,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2019-12-27 01:27:04,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35065 states. [2019-12-27 01:27:04,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35065 to 22778. [2019-12-27 01:27:04,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22778 states. [2019-12-27 01:27:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22778 states to 22778 states and 70805 transitions. [2019-12-27 01:27:04,596 INFO L78 Accepts]: Start accepts. Automaton has 22778 states and 70805 transitions. Word has length 67 [2019-12-27 01:27:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:04,597 INFO L462 AbstractCegarLoop]: Abstraction has 22778 states and 70805 transitions. [2019-12-27 01:27:04,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:27:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 22778 states and 70805 transitions. [2019-12-27 01:27:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:27:04,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:04,621 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:04,621 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:04,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:04,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1535531457, now seen corresponding path program 2 times [2019-12-27 01:27:04,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:04,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125418581] [2019-12-27 01:27:04,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:04,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125418581] [2019-12-27 01:27:04,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:04,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:27:04,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879259299] [2019-12-27 01:27:04,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:27:04,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:04,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:27:04,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:27:04,756 INFO L87 Difference]: Start difference. First operand 22778 states and 70805 transitions. Second operand 10 states. [2019-12-27 01:27:05,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:05,786 INFO L93 Difference]: Finished difference Result 44683 states and 137584 transitions. [2019-12-27 01:27:05,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 01:27:05,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 01:27:05,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:05,846 INFO L225 Difference]: With dead ends: 44683 [2019-12-27 01:27:05,847 INFO L226 Difference]: Without dead ends: 42768 [2019-12-27 01:27:05,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2019-12-27 01:27:05,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42768 states. [2019-12-27 01:27:06,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42768 to 26032. [2019-12-27 01:27:06,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26032 states. [2019-12-27 01:27:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26032 states to 26032 states and 80627 transitions. [2019-12-27 01:27:06,655 INFO L78 Accepts]: Start accepts. Automaton has 26032 states and 80627 transitions. Word has length 67 [2019-12-27 01:27:06,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:06,656 INFO L462 AbstractCegarLoop]: Abstraction has 26032 states and 80627 transitions. [2019-12-27 01:27:06,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:27:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 26032 states and 80627 transitions. [2019-12-27 01:27:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:27:06,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:06,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:06,685 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:06,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:06,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1442171729, now seen corresponding path program 3 times [2019-12-27 01:27:06,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:06,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743123049] [2019-12-27 01:27:06,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:06,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:06,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743123049] [2019-12-27 01:27:06,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:06,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:27:06,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067022610] [2019-12-27 01:27:06,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 01:27:06,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:06,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 01:27:06,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 01:27:06,809 INFO L87 Difference]: Start difference. First operand 26032 states and 80627 transitions. Second operand 10 states. [2019-12-27 01:27:07,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:07,613 INFO L93 Difference]: Finished difference Result 43340 states and 133082 transitions. [2019-12-27 01:27:07,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 01:27:07,613 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 01:27:07,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:07,666 INFO L225 Difference]: With dead ends: 43340 [2019-12-27 01:27:07,666 INFO L226 Difference]: Without dead ends: 36825 [2019-12-27 01:27:07,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-27 01:27:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36825 states. [2019-12-27 01:27:08,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36825 to 22389. [2019-12-27 01:27:08,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22389 states. [2019-12-27 01:27:08,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22389 states to 22389 states and 69376 transitions. [2019-12-27 01:27:08,114 INFO L78 Accepts]: Start accepts. Automaton has 22389 states and 69376 transitions. Word has length 67 [2019-12-27 01:27:08,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:08,114 INFO L462 AbstractCegarLoop]: Abstraction has 22389 states and 69376 transitions. [2019-12-27 01:27:08,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 01:27:08,115 INFO L276 IsEmpty]: Start isEmpty. Operand 22389 states and 69376 transitions. [2019-12-27 01:27:08,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:27:08,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:08,139 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:08,139 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:08,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:08,139 INFO L82 PathProgramCache]: Analyzing trace with hash -2065446981, now seen corresponding path program 4 times [2019-12-27 01:27:08,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:08,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539769139] [2019-12-27 01:27:08,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:08,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539769139] [2019-12-27 01:27:08,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:08,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:27:08,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977685098] [2019-12-27 01:27:08,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:27:08,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:08,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:27:08,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:27:08,350 INFO L87 Difference]: Start difference. First operand 22389 states and 69376 transitions. Second operand 11 states. [2019-12-27 01:27:09,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:09,398 INFO L93 Difference]: Finished difference Result 39336 states and 121084 transitions. [2019-12-27 01:27:09,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 01:27:09,399 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 01:27:09,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:09,453 INFO L225 Difference]: With dead ends: 39336 [2019-12-27 01:27:09,453 INFO L226 Difference]: Without dead ends: 38317 [2019-12-27 01:27:09,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-27 01:27:09,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38317 states. [2019-12-27 01:27:09,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38317 to 24692. [2019-12-27 01:27:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24692 states. [2019-12-27 01:27:09,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24692 states to 24692 states and 76375 transitions. [2019-12-27 01:27:09,937 INFO L78 Accepts]: Start accepts. Automaton has 24692 states and 76375 transitions. Word has length 67 [2019-12-27 01:27:09,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:09,938 INFO L462 AbstractCegarLoop]: Abstraction has 24692 states and 76375 transitions. [2019-12-27 01:27:09,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:27:09,938 INFO L276 IsEmpty]: Start isEmpty. Operand 24692 states and 76375 transitions. [2019-12-27 01:27:09,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:27:09,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:09,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:09,964 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:09,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:09,964 INFO L82 PathProgramCache]: Analyzing trace with hash 2136160587, now seen corresponding path program 5 times [2019-12-27 01:27:09,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:09,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007129079] [2019-12-27 01:27:09,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:10,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007129079] [2019-12-27 01:27:10,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:10,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:27:10,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578419606] [2019-12-27 01:27:10,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:27:10,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:10,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:27:10,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:27:10,119 INFO L87 Difference]: Start difference. First operand 24692 states and 76375 transitions. Second operand 11 states. [2019-12-27 01:27:11,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:11,301 INFO L93 Difference]: Finished difference Result 38879 states and 119266 transitions. [2019-12-27 01:27:11,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 01:27:11,302 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 01:27:11,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:11,349 INFO L225 Difference]: With dead ends: 38879 [2019-12-27 01:27:11,349 INFO L226 Difference]: Without dead ends: 35558 [2019-12-27 01:27:11,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-27 01:27:11,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35558 states. [2019-12-27 01:27:11,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35558 to 21700. [2019-12-27 01:27:11,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21700 states. [2019-12-27 01:27:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21700 states to 21700 states and 67268 transitions. [2019-12-27 01:27:11,753 INFO L78 Accepts]: Start accepts. Automaton has 21700 states and 67268 transitions. Word has length 67 [2019-12-27 01:27:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:11,753 INFO L462 AbstractCegarLoop]: Abstraction has 21700 states and 67268 transitions. [2019-12-27 01:27:11,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:27:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 21700 states and 67268 transitions. [2019-12-27 01:27:11,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:27:11,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:11,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:11,777 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:11,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:11,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1853423759, now seen corresponding path program 6 times [2019-12-27 01:27:11,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:11,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817161914] [2019-12-27 01:27:11,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:27:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:27:11,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817161914] [2019-12-27 01:27:11,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:27:11,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 01:27:11,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478554667] [2019-12-27 01:27:11,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 01:27:11,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:27:11,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 01:27:11,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 01:27:11,937 INFO L87 Difference]: Start difference. First operand 21700 states and 67268 transitions. Second operand 12 states. [2019-12-27 01:27:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:27:12,978 INFO L93 Difference]: Finished difference Result 35737 states and 109819 transitions. [2019-12-27 01:27:12,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 01:27:12,978 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 01:27:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:27:13,025 INFO L225 Difference]: With dead ends: 35737 [2019-12-27 01:27:13,025 INFO L226 Difference]: Without dead ends: 35526 [2019-12-27 01:27:13,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 01:27:13,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35526 states. [2019-12-27 01:27:13,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35526 to 21524. [2019-12-27 01:27:13,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21524 states. [2019-12-27 01:27:13,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21524 states to 21524 states and 66796 transitions. [2019-12-27 01:27:13,445 INFO L78 Accepts]: Start accepts. Automaton has 21524 states and 66796 transitions. Word has length 67 [2019-12-27 01:27:13,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:27:13,445 INFO L462 AbstractCegarLoop]: Abstraction has 21524 states and 66796 transitions. [2019-12-27 01:27:13,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 01:27:13,446 INFO L276 IsEmpty]: Start isEmpty. Operand 21524 states and 66796 transitions. [2019-12-27 01:27:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 01:27:13,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:27:13,470 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:27:13,470 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:27:13,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:27:13,470 INFO L82 PathProgramCache]: Analyzing trace with hash 594227727, now seen corresponding path program 7 times [2019-12-27 01:27:13,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:27:13,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200449394] [2019-12-27 01:27:13,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:27:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:27:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:27:13,584 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:27:13,584 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:27:13,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~x~0_45 0) (= 0 v_~a$w_buff0_used~0_768) (= v_~y~0_18 0) (= 0 v_~a$r_buff1_thd1~0_150) (= 0 v_~__unbuffered_p2_EAX~0_31) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$w_buff1_used~0_426) (= v_~main$tmp_guard0~0_29 0) (= v_~a$read_delayed_var~0.offset_7 0) (= 0 v_~a$w_buff1~0_200) (= v_~a$r_buff1_thd3~0_269 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t275~0.base_33| 4)) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~__unbuffered_p0_EAX~0_111) (= v_~a$r_buff0_thd3~0_320 0) (= v_~a~0_184 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= v_~__unbuffered_cnt~0_102 0) (= 0 |v_#NULL.base_4|) (= v_~a$flush_delayed~0_25 0) (= v_~__unbuffered_p1_EBX~0_34 0) (= v_~a$r_buff0_thd0~0_107 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t275~0.base_33| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t275~0.base_33|) |v_ULTIMATE.start_main_~#t275~0.offset_23| 0)) |v_#memory_int_19|) (= v_~main$tmp_guard1~0_32 0) (= v_~a$r_buff1_thd0~0_160 0) (= v_~a$w_buff0~0_274 0) (= v_~z~0_21 0) (= |v_#NULL.offset_4| 0) (= |v_ULTIMATE.start_main_~#t275~0.offset_23| 0) (= v_~a$mem_tmp~0_14 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t275~0.base_33|)) (= 0 v_~a$r_buff0_thd1~0_184) (= 0 v_~a$r_buff1_thd2~0_145) (= v_~a$r_buff0_thd2~0_95 0) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t275~0.base_33| 1)) (= v_~weak$$choice2~0_110 0) (= v_~__unbuffered_p2_EBX~0_40 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t275~0.base_33|) (= 0 v_~a$read_delayed~0_8) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_145, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_67|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_471|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_107, ULTIMATE.start_main_~#t276~0.base=|v_ULTIMATE.start_main_~#t276~0.base_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ~a~0=v_~a~0_184, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_111, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_40, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_269, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_768, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_184, ULTIMATE.start_main_~#t276~0.offset=|v_ULTIMATE.start_main_~#t276~0.offset_19|, ULTIMATE.start_main_~#t275~0.offset=|v_ULTIMATE.start_main_~#t275~0.offset_23|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_274, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_45, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_95, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ULTIMATE.start_main_~#t277~0.base=|v_ULTIMATE.start_main_~#t277~0.base_25|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_29|, ~a$w_buff1~0=v_~a$w_buff1~0_200, ULTIMATE.start_main_~#t277~0.offset=|v_ULTIMATE.start_main_~#t277~0.offset_19|, ~y~0=v_~y~0_18, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_34, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_150, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t275~0.base=|v_ULTIMATE.start_main_~#t275~0.base_33|, ~z~0=v_~z~0_21, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_426, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_~#t276~0.base, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t276~0.offset, ULTIMATE.start_main_~#t275~0.offset, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t277~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t277~0.offset, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t275~0.base, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 01:27:13,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_20 |v_P0Thread1of1ForFork1_#in~arg.offset_20|) (= 1 v_~a$w_buff0_used~0_240) (= (mod v_~a$w_buff1_used~0_130 256) 0) (= v_~a$w_buff0_used~0_241 v_~a$w_buff1_used~0_130) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|) (= |v_P0Thread1of1ForFork1_#in~arg.base_20| v_P0Thread1of1ForFork1_~arg.base_20) (= 1 v_~a$w_buff0~0_55) (= v_~a$w_buff0~0_56 v_~a$w_buff1~0_50) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_241, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_50, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_20|, ~a$w_buff0~0=v_~a$w_buff0~0_55, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_24, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_240, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_130, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_20|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_20|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_20} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 01:27:13,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L837-1-->L839: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t276~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t276~0.base_12|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t276~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t276~0.base_12|) |v_ULTIMATE.start_main_~#t276~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t276~0.base_12| 4) |v_#length_15|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t276~0.base_12|)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t276~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t276~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t276~0.base=|v_ULTIMATE.start_main_~#t276~0.base_12|, ULTIMATE.start_main_~#t276~0.offset=|v_ULTIMATE.start_main_~#t276~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t276~0.base, ULTIMATE.start_main_~#t276~0.offset] because there is no mapped edge [2019-12-27 01:27:13,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L839-1-->L841: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t277~0.base_12| 4)) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t277~0.base_12| 1) |v_#valid_32|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t277~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t277~0.base_12|) |v_ULTIMATE.start_main_~#t277~0.offset_10| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t277~0.base_12|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t277~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t277~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t277~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t277~0.base=|v_ULTIMATE.start_main_~#t277~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t277~0.offset=|v_ULTIMATE.start_main_~#t277~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t277~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t277~0.offset] because there is no mapped edge [2019-12-27 01:27:13,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L778-2-->L778-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-608042056 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-608042056 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-608042056| ~a~0_In-608042056)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-608042056| ~a$w_buff1~0_In-608042056)))) InVars {~a~0=~a~0_In-608042056, ~a$w_buff1~0=~a$w_buff1~0_In-608042056, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-608042056, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-608042056} OutVars{~a~0=~a~0_In-608042056, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-608042056|, ~a$w_buff1~0=~a$w_buff1~0_In-608042056, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-608042056, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-608042056} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 01:27:13,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L778-4-->L779: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_16| v_~a~0_33) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_16|} OutVars{~a~0=v_~a~0_33, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_15|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_23|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 01:27:13,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In286516566 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In286516566 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out286516566|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In286516566 |P1Thread1of1ForFork2_#t~ite11_Out286516566|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In286516566, ~a$w_buff0_used~0=~a$w_buff0_used~0_In286516566} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In286516566, ~a$w_buff0_used~0=~a$w_buff0_used~0_In286516566, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out286516566|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 01:27:13,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1098206869 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1098206869 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1098206869 |P0Thread1of1ForFork1_#t~ite5_Out-1098206869|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1098206869|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1098206869, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1098206869} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1098206869|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1098206869, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1098206869} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 01:27:13,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L754-->L754-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd1~0_In2052412291 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In2052412291 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In2052412291 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In2052412291 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out2052412291|)) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In2052412291 |P0Thread1of1ForFork1_#t~ite6_Out2052412291|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2052412291, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2052412291, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2052412291, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2052412291} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out2052412291|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In2052412291, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2052412291, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2052412291, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2052412291} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 01:27:13,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L755-->L756: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In255484829 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In255484829 256)))) (or (and (= 0 ~a$r_buff0_thd1~0_Out255484829) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd1~0_Out255484829 ~a$r_buff0_thd1~0_In255484829) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In255484829, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In255484829} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out255484829|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In255484829, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out255484829} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 01:27:13,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L756-->L756-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In-1979513413 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In-1979513413 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-1979513413 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-1979513413 256) 0))) (or (and (= ~a$r_buff1_thd1~0_In-1979513413 |P0Thread1of1ForFork1_#t~ite8_Out-1979513413|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1979513413|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1979513413, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1979513413, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1979513413, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1979513413} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1979513413|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1979513413, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1979513413, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1979513413, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1979513413} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 01:27:13,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L756-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_50|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_49|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 01:27:13,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-567527046 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_Out-567527046| |P2Thread1of1ForFork0_#t~ite21_Out-567527046|) .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out-567527046| ~a$w_buff0~0_In-567527046) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-567527046 256) 0))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-567527046 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In-567527046 256)) (and .cse1 (= (mod ~a$w_buff1_used~0_In-567527046 256) 0))))) (and (= |P2Thread1of1ForFork0_#t~ite20_In-567527046| |P2Thread1of1ForFork0_#t~ite20_Out-567527046|) (= |P2Thread1of1ForFork0_#t~ite21_Out-567527046| ~a$w_buff0~0_In-567527046) (not .cse0)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-567527046, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-567527046, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-567527046, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-567527046, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-567527046, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-567527046|, ~weak$$choice2~0=~weak$$choice2~0_In-567527046} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-567527046|, ~a$w_buff0~0=~a$w_buff0~0_In-567527046, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-567527046, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-567527046, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-567527046, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-567527046|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-567527046, ~weak$$choice2~0=~weak$$choice2~0_In-567527046} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 01:27:13,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L805-->L805-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2028047290 256) 0))) (or (and (= ~a$w_buff0_used~0_In2028047290 |P2Thread1of1ForFork0_#t~ite26_Out2028047290|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In2028047290 256)))) (or (= (mod ~a$w_buff0_used~0_In2028047290 256) 0) (and (= 0 (mod ~a$w_buff1_used~0_In2028047290 256)) .cse1) (and (= (mod ~a$r_buff1_thd3~0_In2028047290 256) 0) .cse1))) (= |P2Thread1of1ForFork0_#t~ite27_Out2028047290| |P2Thread1of1ForFork0_#t~ite26_Out2028047290|)) (and (= |P2Thread1of1ForFork0_#t~ite26_In2028047290| |P2Thread1of1ForFork0_#t~ite26_Out2028047290|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out2028047290| ~a$w_buff0_used~0_In2028047290)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In2028047290|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2028047290, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2028047290, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2028047290, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2028047290, ~weak$$choice2~0=~weak$$choice2~0_In2028047290} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out2028047290|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out2028047290|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2028047290, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2028047290, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2028047290, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2028047290, ~weak$$choice2~0=~weak$$choice2~0_In2028047290} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 01:27:13,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L807-->L808: Formula: (and (= v_~a$r_buff0_thd3~0_61 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 01:27:13,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L810-->L814: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a~0_20 v_~a$mem_tmp~0_4) (= v_~a$flush_delayed~0_6 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_20, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 01:27:13,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L814-2-->L814-5: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In1986446317 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd3~0_In1986446317 256) 0)) (.cse1 (= |P2Thread1of1ForFork0_#t~ite38_Out1986446317| |P2Thread1of1ForFork0_#t~ite39_Out1986446317|))) (or (and (not .cse0) (= ~a$w_buff1~0_In1986446317 |P2Thread1of1ForFork0_#t~ite38_Out1986446317|) .cse1 (not .cse2)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out1986446317| ~a~0_In1986446317) (or .cse2 .cse0) .cse1))) InVars {~a~0=~a~0_In1986446317, ~a$w_buff1~0=~a$w_buff1~0_In1986446317, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1986446317, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1986446317} OutVars{~a~0=~a~0_In1986446317, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1986446317|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1986446317|, ~a$w_buff1~0=~a$w_buff1~0_In1986446317, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1986446317, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1986446317} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 01:27:13,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1559117355 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd3~0_In1559117355 256) 0))) (or (and (= ~a$w_buff0_used~0_In1559117355 |P2Thread1of1ForFork0_#t~ite40_Out1559117355|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1559117355|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1559117355, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1559117355} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1559117355|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1559117355, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1559117355} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 01:27:13,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L816-->L816-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd3~0_In-1859204271 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-1859204271 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1859204271 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd3~0_In-1859204271 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out-1859204271| ~a$w_buff1_used~0_In-1859204271) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1859204271|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1859204271, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1859204271, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1859204271, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1859204271} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1859204271, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1859204271, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1859204271, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1859204271, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1859204271|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 01:27:13,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L780-->L780-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In1696780390 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In1696780390 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1696780390 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1696780390 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out1696780390| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~a$w_buff1_used~0_In1696780390 |P1Thread1of1ForFork2_#t~ite12_Out1696780390|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1696780390, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1696780390, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1696780390, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1696780390} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1696780390, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1696780390, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1696780390, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1696780390|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1696780390} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 01:27:13,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1925624632 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1925624632 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out-1925624632| ~a$r_buff0_thd2~0_In-1925624632) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-1925624632| 0) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1925624632, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1925624632} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1925624632, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1925624632, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1925624632|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 01:27:13,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-605843768 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-605843768 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-605843768 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-605843768 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out-605843768| ~a$r_buff1_thd2~0_In-605843768)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-605843768| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-605843768, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-605843768, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-605843768, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-605843768} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-605843768, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-605843768, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-605843768, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-605843768, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-605843768|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 01:27:13,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L782-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_36| v_~a$r_buff1_thd2~0_63)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_36|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_35|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 01:27:13,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In732874943 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In732874943 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out732874943|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$r_buff0_thd3~0_In732874943 |P2Thread1of1ForFork0_#t~ite42_Out732874943|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In732874943, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In732874943} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In732874943, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In732874943, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out732874943|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 01:27:13,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L818-->L818-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In1792697241 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In1792697241 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1792697241 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1792697241 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out1792697241| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~a$r_buff1_thd3~0_In1792697241 |P2Thread1of1ForFork0_#t~ite43_Out1792697241|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1792697241, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1792697241, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1792697241, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1792697241} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1792697241|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1792697241, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1792697241, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1792697241, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1792697241} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 01:27:13,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L818-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_149 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_149, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 01:27:13,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L841-1-->L847: Formula: (and (= 3 v_~__unbuffered_cnt~0_40) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:27:13,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L847-2-->L847-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-922445135 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd0~0_In-922445135 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-922445135| ~a~0_In-922445135) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~a$w_buff1~0_In-922445135 |ULTIMATE.start_main_#t~ite47_Out-922445135|)))) InVars {~a~0=~a~0_In-922445135, ~a$w_buff1~0=~a$w_buff1~0_In-922445135, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-922445135, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-922445135} OutVars{~a~0=~a~0_In-922445135, ~a$w_buff1~0=~a$w_buff1~0_In-922445135, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-922445135|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-922445135, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-922445135} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 01:27:13,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L847-4-->L848: Formula: (= v_~a~0_39 |v_ULTIMATE.start_main_#t~ite47_15|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|} OutVars{~a~0=v_~a~0_39, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 01:27:13,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-531485332 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-531485332 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-531485332 |ULTIMATE.start_main_#t~ite49_Out-531485332|)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-531485332|) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-531485332, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-531485332} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-531485332, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-531485332|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-531485332} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 01:27:13,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L849-->L849-2: Formula: (let ((.cse3 (= (mod ~a$r_buff1_thd0~0_In-438449527 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-438449527 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-438449527 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-438449527 256) 0))) (or (and (= ~a$w_buff1_used~0_In-438449527 |ULTIMATE.start_main_#t~ite50_Out-438449527|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out-438449527| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-438449527, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-438449527, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-438449527, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-438449527} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-438449527|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-438449527, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-438449527, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-438449527, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-438449527} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 01:27:13,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L850-->L850-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-72326895 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-72326895 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-72326895| 0)) (and (= |ULTIMATE.start_main_#t~ite51_Out-72326895| ~a$r_buff0_thd0~0_In-72326895) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-72326895, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-72326895} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-72326895|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-72326895, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-72326895} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 01:27:13,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L851-->L851-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In1744295858 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In1744295858 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In1744295858 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In1744295858 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out1744295858| ~a$r_buff1_thd0~0_In1744295858) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out1744295858| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1744295858, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1744295858, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1744295858, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1744295858} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1744295858|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1744295858, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1744295858, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1744295858, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1744295858} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 01:27:13,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L851-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_17) (= v_~__unbuffered_p1_EBX~0_17 0) (= 0 v_~__unbuffered_p0_EAX~0_39) (= v_~main$tmp_guard1~0_12 0) (= 1 v_~__unbuffered_p1_EAX~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start_main_#t~ite52_30| v_~a$r_buff1_thd0~0_75) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_12 256)) (= v_~__unbuffered_p2_EBX~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_30|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_39, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_29|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_17, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:27:13,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:27:13 BasicIcfg [2019-12-27 01:27:13,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:27:13,732 INFO L168 Benchmark]: Toolchain (without parser) took 142439.45 ms. Allocated memory was 145.2 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 103.2 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 01:27:13,732 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 01:27:13,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 735.03 ms. Allocated memory was 145.2 MB in the beginning and 204.5 MB in the end (delta: 59.2 MB). Free memory was 102.7 MB in the beginning and 156.5 MB in the end (delta: -53.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:13,733 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.35 ms. Allocated memory is still 204.5 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:13,733 INFO L168 Benchmark]: Boogie Preprocessor took 39.52 ms. Allocated memory is still 204.5 MB. Free memory was 153.8 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:13,733 INFO L168 Benchmark]: RCFGBuilder took 820.10 ms. Allocated memory is still 204.5 MB. Free memory was 151.1 MB in the beginning and 100.6 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-27 01:27:13,734 INFO L168 Benchmark]: TraceAbstraction took 140772.59 ms. Allocated memory was 204.5 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 99.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 01:27:13,739 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 145.2 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 735.03 ms. Allocated memory was 145.2 MB in the beginning and 204.5 MB in the end (delta: 59.2 MB). Free memory was 102.7 MB in the beginning and 156.5 MB in the end (delta: -53.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.35 ms. Allocated memory is still 204.5 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.52 ms. Allocated memory is still 204.5 MB. Free memory was 153.8 MB in the beginning and 151.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 820.10 ms. Allocated memory is still 204.5 MB. Free memory was 151.1 MB in the beginning and 100.6 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 140772.59 ms. Allocated memory was 204.5 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 99.9 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 179 ProgramPointsBefore, 95 ProgramPointsAfterwards, 216 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6646 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 59 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 91218 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t275, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L742] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L743] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L744] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L745] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L746] 1 a$r_buff0_thd1 = (_Bool)1 [L749] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t276, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L766] 2 x = 1 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L841] FCALL, FORK 0 pthread_create(&t277, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L778] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 a$flush_delayed = weak$$choice2 [L801] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L802] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L803] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L804] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L804] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L805] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L806] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L808] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L814] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L815] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L817] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L847] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L848] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L849] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L850] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 140.4s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 44.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10986 SDtfs, 16893 SDslu, 42069 SDs, 0 SdLazy, 20624 SolverSat, 846 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 605 GetRequests, 72 SyntacticMatches, 30 SemanticMatches, 503 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2457 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168271occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 63.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 782609 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1975 NumberOfCodeBlocks, 1975 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1871 ConstructedInterpolants, 0 QuantifiedInterpolants, 435307 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...