/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:14:25,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:14:25,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:14:26,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:14:26,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:14:26,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:14:26,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:14:26,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:14:26,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:14:26,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:14:26,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:14:26,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:14:26,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:14:26,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:14:26,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:14:26,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:14:26,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:14:26,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:14:26,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:14:26,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:14:26,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:14:26,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:14:26,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:14:26,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:14:26,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:14:26,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:14:26,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:14:26,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:14:26,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:14:26,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:14:26,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:14:26,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:14:26,052 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:14:26,053 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:14:26,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:14:26,054 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:14:26,055 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:14:26,055 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:14:26,055 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:14:26,056 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:14:26,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:14:26,057 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:14:26,084 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:14:26,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:14:26,088 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:14:26,088 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:14:26,089 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:14:26,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:14:26,089 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:14:26,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:14:26,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:14:26,090 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:14:26,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:14:26,090 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:14:26,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:14:26,090 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:14:26,090 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:14:26,091 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:14:26,091 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:14:26,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:14:26,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:14:26,091 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:14:26,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:14:26,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:14:26,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:14:26,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:14:26,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:14:26,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:14:26,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:14:26,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:14:26,094 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:14:26,095 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:14:26,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:14:26,388 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:14:26,391 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:14:26,392 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:14:26,393 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:14:26,394 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_rmo.oepc.i [2019-12-18 12:14:26,468 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32e150fe6/0dc937cc43cd4c46bb4c963185be047e/FLAG33af200a7 [2019-12-18 12:14:26,984 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:14:26,985 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_rmo.oepc.i [2019-12-18 12:14:27,001 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32e150fe6/0dc937cc43cd4c46bb4c963185be047e/FLAG33af200a7 [2019-12-18 12:14:27,291 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32e150fe6/0dc937cc43cd4c46bb4c963185be047e [2019-12-18 12:14:27,300 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:14:27,302 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:14:27,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:14:27,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:14:27,307 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:14:27,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:14:27" (1/1) ... [2019-12-18 12:14:27,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6229c7ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:14:27, skipping insertion in model container [2019-12-18 12:14:27,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:14:27" (1/1) ... [2019-12-18 12:14:27,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:14:27,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:14:27,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:14:27,996 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:14:28,073 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:14:28,144 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:14:28,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:14:28 WrapperNode [2019-12-18 12:14:28,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:14:28,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:14:28,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:14:28,146 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:14:28,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:14:28" (1/1) ... [2019-12-18 12:14:28,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:14:28" (1/1) ... [2019-12-18 12:14:28,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:14:28,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:14:28,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:14:28,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:14:28,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:14:28" (1/1) ... [2019-12-18 12:14:28,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:14:28" (1/1) ... [2019-12-18 12:14:28,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:14:28" (1/1) ... [2019-12-18 12:14:28,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:14:28" (1/1) ... [2019-12-18 12:14:28,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:14:28" (1/1) ... [2019-12-18 12:14:28,240 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:14:28" (1/1) ... [2019-12-18 12:14:28,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:14:28" (1/1) ... [2019-12-18 12:14:28,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:14:28,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:14:28,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:14:28,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:14:28,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:14:28" (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-18 12:14:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:14:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:14:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:14:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:14:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:14:28,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:14:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:14:28,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:14:28,321 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:14:28,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:14:28,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:14:28,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:14:28,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:14:28,324 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:14:29,108 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:14:29,108 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:14:29,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:14:29 BoogieIcfgContainer [2019-12-18 12:14:29,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:14:29,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:14:29,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:14:29,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:14:29,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:14:27" (1/3) ... [2019-12-18 12:14:29,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a2f34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:14:29, skipping insertion in model container [2019-12-18 12:14:29,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:14:28" (2/3) ... [2019-12-18 12:14:29,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a2f34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:14:29, skipping insertion in model container [2019-12-18 12:14:29,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:14:29" (3/3) ... [2019-12-18 12:14:29,118 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_rmo.oepc.i [2019-12-18 12:14:29,129 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:14:29,129 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:14:29,138 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:14:29,139 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:14:29,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,183 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,183 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,183 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,184 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,184 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,187 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,188 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,189 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,190 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,211 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,211 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,219 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,219 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,236 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,247 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,249 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,252 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,257 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,257 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,257 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,259 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,259 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:14:29,275 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:14:29,296 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:14:29,296 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:14:29,296 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:14:29,296 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:14:29,297 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:14:29,297 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:14:29,297 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:14:29,297 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:14:29,315 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 12:14:29,317 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 12:14:29,431 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 12:14:29,431 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:14:29,458 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:14:29,484 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 12:14:29,567 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 12:14:29,567 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:14:29,579 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:14:29,596 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:14:29,597 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:14:35,027 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 12:14:35,151 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 12:14:35,171 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78628 [2019-12-18 12:14:35,171 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 12:14:35,175 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-18 12:14:52,443 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 110182 states. [2019-12-18 12:14:52,445 INFO L276 IsEmpty]: Start isEmpty. Operand 110182 states. [2019-12-18 12:14:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:14:52,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:52,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:14:52,452 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-18 12:14:52,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:52,458 INFO L82 PathProgramCache]: Analyzing trace with hash 917838, now seen corresponding path program 1 times [2019-12-18 12:14:52,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:52,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348397383] [2019-12-18 12:14:52,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:52,684 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-18 12:14:52,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348397383] [2019-12-18 12:14:52,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:52,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:14:52,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757625631] [2019-12-18 12:14:52,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:14:52,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:52,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:14:52,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:14:52,710 INFO L87 Difference]: Start difference. First operand 110182 states. Second operand 3 states. [2019-12-18 12:14:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:54,300 INFO L93 Difference]: Finished difference Result 109312 states and 463550 transitions. [2019-12-18 12:14:54,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:14:54,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:14:54,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:58,054 INFO L225 Difference]: With dead ends: 109312 [2019-12-18 12:14:58,054 INFO L226 Difference]: Without dead ends: 102592 [2019-12-18 12:14:58,056 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-18 12:15:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102592 states. [2019-12-18 12:15:04,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102592 to 102592. [2019-12-18 12:15:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102592 states. [2019-12-18 12:15:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102592 states to 102592 states and 434430 transitions. [2019-12-18 12:15:08,511 INFO L78 Accepts]: Start accepts. Automaton has 102592 states and 434430 transitions. Word has length 3 [2019-12-18 12:15:08,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:08,511 INFO L462 AbstractCegarLoop]: Abstraction has 102592 states and 434430 transitions. [2019-12-18 12:15:08,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:15:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 102592 states and 434430 transitions. [2019-12-18 12:15:08,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:15:08,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:08,515 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:15:08,515 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-18 12:15:08,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:08,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1857942485, now seen corresponding path program 1 times [2019-12-18 12:15:08,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:08,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830234527] [2019-12-18 12:15:08,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:08,631 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-18 12:15:08,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830234527] [2019-12-18 12:15:08,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:08,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:15:08,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896093794] [2019-12-18 12:15:08,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:15:08,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:08,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:15:08,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:15:08,634 INFO L87 Difference]: Start difference. First operand 102592 states and 434430 transitions. Second operand 4 states. [2019-12-18 12:15:13,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:13,879 INFO L93 Difference]: Finished difference Result 159508 states and 648686 transitions. [2019-12-18 12:15:13,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:15:13,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:15:13,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:14,418 INFO L225 Difference]: With dead ends: 159508 [2019-12-18 12:15:14,418 INFO L226 Difference]: Without dead ends: 159459 [2019-12-18 12:15:14,419 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-18 12:15:18,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159459 states. [2019-12-18 12:15:22,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159459 to 146095. [2019-12-18 12:15:22,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146095 states. [2019-12-18 12:15:22,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146095 states to 146095 states and 601450 transitions. [2019-12-18 12:15:22,842 INFO L78 Accepts]: Start accepts. Automaton has 146095 states and 601450 transitions. Word has length 11 [2019-12-18 12:15:22,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:22,842 INFO L462 AbstractCegarLoop]: Abstraction has 146095 states and 601450 transitions. [2019-12-18 12:15:22,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:15:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 146095 states and 601450 transitions. [2019-12-18 12:15:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:15:22,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:22,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:15:22,850 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-18 12:15:22,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:22,851 INFO L82 PathProgramCache]: Analyzing trace with hash 230844073, now seen corresponding path program 1 times [2019-12-18 12:15:22,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:22,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704086632] [2019-12-18 12:15:22,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:22,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-18 12:15:22,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704086632] [2019-12-18 12:15:22,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:22,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:15:22,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216153531] [2019-12-18 12:15:22,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:15:22,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:22,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:15:22,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:15:22,937 INFO L87 Difference]: Start difference. First operand 146095 states and 601450 transitions. Second operand 3 states. [2019-12-18 12:15:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:23,063 INFO L93 Difference]: Finished difference Result 32284 states and 104220 transitions. [2019-12-18 12:15:23,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:15:23,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:15:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:23,119 INFO L225 Difference]: With dead ends: 32284 [2019-12-18 12:15:23,119 INFO L226 Difference]: Without dead ends: 32284 [2019-12-18 12:15:23,119 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-18 12:15:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32284 states. [2019-12-18 12:15:28,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32284 to 32284. [2019-12-18 12:15:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32284 states. [2019-12-18 12:15:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32284 states to 32284 states and 104220 transitions. [2019-12-18 12:15:28,142 INFO L78 Accepts]: Start accepts. Automaton has 32284 states and 104220 transitions. Word has length 13 [2019-12-18 12:15:28,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:28,142 INFO L462 AbstractCegarLoop]: Abstraction has 32284 states and 104220 transitions. [2019-12-18 12:15:28,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:15:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 32284 states and 104220 transitions. [2019-12-18 12:15:28,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:15:28,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:28,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:15:28,147 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-18 12:15:28,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:28,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1069845708, now seen corresponding path program 1 times [2019-12-18 12:15:28,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:28,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449075679] [2019-12-18 12:15:28,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:28,259 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-18 12:15:28,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449075679] [2019-12-18 12:15:28,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:28,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:15:28,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538632106] [2019-12-18 12:15:28,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:15:28,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:28,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:15:28,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:15:28,264 INFO L87 Difference]: Start difference. First operand 32284 states and 104220 transitions. Second operand 4 states. [2019-12-18 12:15:28,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:28,601 INFO L93 Difference]: Finished difference Result 40215 states and 129418 transitions. [2019-12-18 12:15:28,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:15:28,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:15:28,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:28,664 INFO L225 Difference]: With dead ends: 40215 [2019-12-18 12:15:28,665 INFO L226 Difference]: Without dead ends: 40215 [2019-12-18 12:15:28,665 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-18 12:15:28,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40215 states. [2019-12-18 12:15:29,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40215 to 36090. [2019-12-18 12:15:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36090 states. [2019-12-18 12:15:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36090 states to 36090 states and 116495 transitions. [2019-12-18 12:15:29,610 INFO L78 Accepts]: Start accepts. Automaton has 36090 states and 116495 transitions. Word has length 16 [2019-12-18 12:15:29,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:29,611 INFO L462 AbstractCegarLoop]: Abstraction has 36090 states and 116495 transitions. [2019-12-18 12:15:29,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:15:29,611 INFO L276 IsEmpty]: Start isEmpty. Operand 36090 states and 116495 transitions. [2019-12-18 12:15:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:15:29,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:29,620 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-18 12:15:29,620 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-18 12:15:29,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:29,621 INFO L82 PathProgramCache]: Analyzing trace with hash 6986775, now seen corresponding path program 1 times [2019-12-18 12:15:29,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:29,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438890484] [2019-12-18 12:15:29,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:29,734 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-18 12:15:29,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438890484] [2019-12-18 12:15:29,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:29,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:15:29,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670124854] [2019-12-18 12:15:29,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:15:29,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:29,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:15:29,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:15:29,737 INFO L87 Difference]: Start difference. First operand 36090 states and 116495 transitions. Second operand 5 states. [2019-12-18 12:15:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:30,319 INFO L93 Difference]: Finished difference Result 46566 states and 147831 transitions. [2019-12-18 12:15:30,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:15:30,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:15:30,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:30,393 INFO L225 Difference]: With dead ends: 46566 [2019-12-18 12:15:30,394 INFO L226 Difference]: Without dead ends: 46559 [2019-12-18 12:15:30,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:15:30,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46559 states. [2019-12-18 12:15:30,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46559 to 35784. [2019-12-18 12:15:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35784 states. [2019-12-18 12:15:31,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35784 states to 35784 states and 115349 transitions. [2019-12-18 12:15:31,623 INFO L78 Accepts]: Start accepts. Automaton has 35784 states and 115349 transitions. Word has length 22 [2019-12-18 12:15:31,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:31,623 INFO L462 AbstractCegarLoop]: Abstraction has 35784 states and 115349 transitions. [2019-12-18 12:15:31,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:15:31,623 INFO L276 IsEmpty]: Start isEmpty. Operand 35784 states and 115349 transitions. [2019-12-18 12:15:31,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:15:31,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:31,635 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-18 12:15:31,636 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-18 12:15:31,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:31,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1437372217, now seen corresponding path program 1 times [2019-12-18 12:15:31,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:31,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412261545] [2019-12-18 12:15:31,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:31,691 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-18 12:15:31,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412261545] [2019-12-18 12:15:31,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:31,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:15:31,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759866214] [2019-12-18 12:15:31,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:15:31,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:31,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:15:31,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:15:31,697 INFO L87 Difference]: Start difference. First operand 35784 states and 115349 transitions. Second operand 4 states. [2019-12-18 12:15:31,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:31,764 INFO L93 Difference]: Finished difference Result 14498 states and 44125 transitions. [2019-12-18 12:15:31,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:15:31,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:15:31,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:31,787 INFO L225 Difference]: With dead ends: 14498 [2019-12-18 12:15:31,787 INFO L226 Difference]: Without dead ends: 14498 [2019-12-18 12:15:31,787 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-18 12:15:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14498 states. [2019-12-18 12:15:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14498 to 14254. [2019-12-18 12:15:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14254 states. [2019-12-18 12:15:32,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14254 states to 14254 states and 43429 transitions. [2019-12-18 12:15:32,013 INFO L78 Accepts]: Start accepts. Automaton has 14254 states and 43429 transitions. Word has length 25 [2019-12-18 12:15:32,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:32,013 INFO L462 AbstractCegarLoop]: Abstraction has 14254 states and 43429 transitions. [2019-12-18 12:15:32,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:15:32,014 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states and 43429 transitions. [2019-12-18 12:15:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:15:32,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:32,027 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-18 12:15:32,027 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-18 12:15:32,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:32,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1947963172, now seen corresponding path program 1 times [2019-12-18 12:15:32,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:32,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582108830] [2019-12-18 12:15:32,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:32,156 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-18 12:15:32,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582108830] [2019-12-18 12:15:32,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:32,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:15:32,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155310367] [2019-12-18 12:15:32,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:15:32,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:32,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:15:32,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:15:32,158 INFO L87 Difference]: Start difference. First operand 14254 states and 43429 transitions. Second operand 6 states. [2019-12-18 12:15:32,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:32,893 INFO L93 Difference]: Finished difference Result 39008 states and 118911 transitions. [2019-12-18 12:15:32,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:15:32,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:15:32,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:32,953 INFO L225 Difference]: With dead ends: 39008 [2019-12-18 12:15:32,954 INFO L226 Difference]: Without dead ends: 39008 [2019-12-18 12:15:32,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:15:33,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39008 states. [2019-12-18 12:15:33,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39008 to 21620. [2019-12-18 12:15:33,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21620 states. [2019-12-18 12:15:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21620 states to 21620 states and 66985 transitions. [2019-12-18 12:15:33,411 INFO L78 Accepts]: Start accepts. Automaton has 21620 states and 66985 transitions. Word has length 27 [2019-12-18 12:15:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:33,412 INFO L462 AbstractCegarLoop]: Abstraction has 21620 states and 66985 transitions. [2019-12-18 12:15:33,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:15:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 21620 states and 66985 transitions. [2019-12-18 12:15:33,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:15:33,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:33,429 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] [2019-12-18 12:15:33,429 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-18 12:15:33,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:33,429 INFO L82 PathProgramCache]: Analyzing trace with hash -89566793, now seen corresponding path program 1 times [2019-12-18 12:15:33,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:33,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349667854] [2019-12-18 12:15:33,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:33,509 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-18 12:15:33,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349667854] [2019-12-18 12:15:33,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:33,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:15:33,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361005271] [2019-12-18 12:15:33,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:15:33,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:33,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:15:33,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:15:33,511 INFO L87 Difference]: Start difference. First operand 21620 states and 66985 transitions. Second operand 6 states. [2019-12-18 12:15:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:34,528 INFO L93 Difference]: Finished difference Result 43584 states and 132186 transitions. [2019-12-18 12:15:34,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:15:34,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 12:15:34,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:34,602 INFO L225 Difference]: With dead ends: 43584 [2019-12-18 12:15:34,602 INFO L226 Difference]: Without dead ends: 43584 [2019-12-18 12:15:34,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:15:34,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43584 states. [2019-12-18 12:15:35,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43584 to 21360. [2019-12-18 12:15:35,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21360 states. [2019-12-18 12:15:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21360 states to 21360 states and 66500 transitions. [2019-12-18 12:15:35,089 INFO L78 Accepts]: Start accepts. Automaton has 21360 states and 66500 transitions. Word has length 28 [2019-12-18 12:15:35,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:35,089 INFO L462 AbstractCegarLoop]: Abstraction has 21360 states and 66500 transitions. [2019-12-18 12:15:35,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:15:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 21360 states and 66500 transitions. [2019-12-18 12:15:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:15:35,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:35,115 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-18 12:15:35,115 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-18 12:15:35,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:35,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1720610055, now seen corresponding path program 1 times [2019-12-18 12:15:35,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:35,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068324085] [2019-12-18 12:15:35,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:35,231 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-18 12:15:35,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068324085] [2019-12-18 12:15:35,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:35,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:15:35,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869042566] [2019-12-18 12:15:35,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:15:35,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:35,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:15:35,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:15:35,237 INFO L87 Difference]: Start difference. First operand 21360 states and 66500 transitions. Second operand 7 states. [2019-12-18 12:15:36,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:36,567 INFO L93 Difference]: Finished difference Result 51613 states and 157651 transitions. [2019-12-18 12:15:36,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:15:36,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 12:15:36,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:36,643 INFO L225 Difference]: With dead ends: 51613 [2019-12-18 12:15:36,643 INFO L226 Difference]: Without dead ends: 51613 [2019-12-18 12:15:36,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:15:36,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51613 states. [2019-12-18 12:15:37,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51613 to 23540. [2019-12-18 12:15:37,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23540 states. [2019-12-18 12:15:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23540 states to 23540 states and 73219 transitions. [2019-12-18 12:15:37,436 INFO L78 Accepts]: Start accepts. Automaton has 23540 states and 73219 transitions. Word has length 33 [2019-12-18 12:15:37,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:37,437 INFO L462 AbstractCegarLoop]: Abstraction has 23540 states and 73219 transitions. [2019-12-18 12:15:37,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:15:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 23540 states and 73219 transitions. [2019-12-18 12:15:37,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:15:37,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:37,462 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-18 12:15:37,462 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-18 12:15:37,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:37,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1518720007, now seen corresponding path program 2 times [2019-12-18 12:15:37,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:37,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14140096] [2019-12-18 12:15:37,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:37,573 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-18 12:15:37,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14140096] [2019-12-18 12:15:37,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:37,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:15:37,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631710898] [2019-12-18 12:15:37,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:15:37,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:37,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:15:37,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:15:37,575 INFO L87 Difference]: Start difference. First operand 23540 states and 73219 transitions. Second operand 8 states. [2019-12-18 12:15:39,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:39,644 INFO L93 Difference]: Finished difference Result 79921 states and 239364 transitions. [2019-12-18 12:15:39,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:15:39,644 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 12:15:39,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:39,764 INFO L225 Difference]: With dead ends: 79921 [2019-12-18 12:15:39,765 INFO L226 Difference]: Without dead ends: 79921 [2019-12-18 12:15:39,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2019-12-18 12:15:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79921 states. [2019-12-18 12:15:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79921 to 22493. [2019-12-18 12:15:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22493 states. [2019-12-18 12:15:40,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22493 states to 22493 states and 69836 transitions. [2019-12-18 12:15:40,839 INFO L78 Accepts]: Start accepts. Automaton has 22493 states and 69836 transitions. Word has length 33 [2019-12-18 12:15:40,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:40,839 INFO L462 AbstractCegarLoop]: Abstraction has 22493 states and 69836 transitions. [2019-12-18 12:15:40,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:15:40,839 INFO L276 IsEmpty]: Start isEmpty. Operand 22493 states and 69836 transitions. [2019-12-18 12:15:40,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:15:40,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:40,862 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] [2019-12-18 12:15:40,862 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-18 12:15:40,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:40,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2146187134, now seen corresponding path program 1 times [2019-12-18 12:15:40,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:40,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603905676] [2019-12-18 12:15:40,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:41,007 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-18 12:15:41,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603905676] [2019-12-18 12:15:41,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:41,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:15:41,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054750396] [2019-12-18 12:15:41,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:15:41,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:41,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:15:41,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:15:41,009 INFO L87 Difference]: Start difference. First operand 22493 states and 69836 transitions. Second operand 7 states. [2019-12-18 12:15:42,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:42,555 INFO L93 Difference]: Finished difference Result 45327 states and 136889 transitions. [2019-12-18 12:15:42,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:15:42,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 12:15:42,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:42,620 INFO L225 Difference]: With dead ends: 45327 [2019-12-18 12:15:42,621 INFO L226 Difference]: Without dead ends: 45327 [2019-12-18 12:15:42,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:15:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45327 states. [2019-12-18 12:15:43,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45327 to 20305. [2019-12-18 12:15:43,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20305 states. [2019-12-18 12:15:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20305 states to 20305 states and 63138 transitions. [2019-12-18 12:15:43,082 INFO L78 Accepts]: Start accepts. Automaton has 20305 states and 63138 transitions. Word has length 34 [2019-12-18 12:15:43,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:43,082 INFO L462 AbstractCegarLoop]: Abstraction has 20305 states and 63138 transitions. [2019-12-18 12:15:43,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:15:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 20305 states and 63138 transitions. [2019-12-18 12:15:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:15:43,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:43,102 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] [2019-12-18 12:15:43,102 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-18 12:15:43,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:43,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1401085166, now seen corresponding path program 2 times [2019-12-18 12:15:43,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:43,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116510580] [2019-12-18 12:15:43,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:43,552 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-18 12:15:43,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116510580] [2019-12-18 12:15:43,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:43,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:15:43,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583865720] [2019-12-18 12:15:43,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:15:43,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:43,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:15:43,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:15:43,554 INFO L87 Difference]: Start difference. First operand 20305 states and 63138 transitions. Second operand 8 states. [2019-12-18 12:15:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:45,571 INFO L93 Difference]: Finished difference Result 60447 states and 179980 transitions. [2019-12-18 12:15:45,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:15:45,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 12:15:45,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:45,728 INFO L225 Difference]: With dead ends: 60447 [2019-12-18 12:15:45,728 INFO L226 Difference]: Without dead ends: 60447 [2019-12-18 12:15:45,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2019-12-18 12:15:45,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60447 states. [2019-12-18 12:15:46,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60447 to 18462. [2019-12-18 12:15:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18462 states. [2019-12-18 12:15:46,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18462 states to 18462 states and 57434 transitions. [2019-12-18 12:15:46,670 INFO L78 Accepts]: Start accepts. Automaton has 18462 states and 57434 transitions. Word has length 34 [2019-12-18 12:15:46,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:46,671 INFO L462 AbstractCegarLoop]: Abstraction has 18462 states and 57434 transitions. [2019-12-18 12:15:46,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:15:46,671 INFO L276 IsEmpty]: Start isEmpty. Operand 18462 states and 57434 transitions. [2019-12-18 12:15:46,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:15:46,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:46,691 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-18 12:15:46,691 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-18 12:15:46,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:46,691 INFO L82 PathProgramCache]: Analyzing trace with hash 342833665, now seen corresponding path program 1 times [2019-12-18 12:15:46,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:46,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609327863] [2019-12-18 12:15:46,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:46,736 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-18 12:15:46,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609327863] [2019-12-18 12:15:46,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:46,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:15:46,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850701373] [2019-12-18 12:15:46,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:15:46,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:46,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:15:46,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:15:46,739 INFO L87 Difference]: Start difference. First operand 18462 states and 57434 transitions. Second operand 3 states. [2019-12-18 12:15:46,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:46,816 INFO L93 Difference]: Finished difference Result 18461 states and 57432 transitions. [2019-12-18 12:15:46,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:15:46,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:15:46,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:46,846 INFO L225 Difference]: With dead ends: 18461 [2019-12-18 12:15:46,846 INFO L226 Difference]: Without dead ends: 18461 [2019-12-18 12:15:46,846 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-18 12:15:46,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18461 states. [2019-12-18 12:15:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18461 to 18461. [2019-12-18 12:15:47,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18461 states. [2019-12-18 12:15:47,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18461 states to 18461 states and 57432 transitions. [2019-12-18 12:15:47,434 INFO L78 Accepts]: Start accepts. Automaton has 18461 states and 57432 transitions. Word has length 39 [2019-12-18 12:15:47,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:47,436 INFO L462 AbstractCegarLoop]: Abstraction has 18461 states and 57432 transitions. [2019-12-18 12:15:47,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:15:47,436 INFO L276 IsEmpty]: Start isEmpty. Operand 18461 states and 57432 transitions. [2019-12-18 12:15:47,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:15:47,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:47,462 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-18 12:15:47,462 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-18 12:15:47,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:47,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1054064562, now seen corresponding path program 1 times [2019-12-18 12:15:47,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:47,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972511807] [2019-12-18 12:15:47,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:47,507 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-18 12:15:47,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972511807] [2019-12-18 12:15:47,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:47,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:15:47,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910623702] [2019-12-18 12:15:47,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:15:47,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:47,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:15:47,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:15:47,509 INFO L87 Difference]: Start difference. First operand 18461 states and 57432 transitions. Second operand 3 states. [2019-12-18 12:15:47,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:47,665 INFO L93 Difference]: Finished difference Result 32125 states and 100306 transitions. [2019-12-18 12:15:47,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:15:47,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 12:15:47,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:47,707 INFO L225 Difference]: With dead ends: 32125 [2019-12-18 12:15:47,707 INFO L226 Difference]: Without dead ends: 16527 [2019-12-18 12:15:47,708 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-18 12:15:47,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16527 states. [2019-12-18 12:15:48,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16527 to 16461. [2019-12-18 12:15:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16461 states. [2019-12-18 12:15:48,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16461 states to 16461 states and 50424 transitions. [2019-12-18 12:15:48,050 INFO L78 Accepts]: Start accepts. Automaton has 16461 states and 50424 transitions. Word has length 40 [2019-12-18 12:15:48,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:48,051 INFO L462 AbstractCegarLoop]: Abstraction has 16461 states and 50424 transitions. [2019-12-18 12:15:48,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:15:48,051 INFO L276 IsEmpty]: Start isEmpty. Operand 16461 states and 50424 transitions. [2019-12-18 12:15:48,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:15:48,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:48,071 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-18 12:15:48,072 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-18 12:15:48,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:48,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1620503104, now seen corresponding path program 2 times [2019-12-18 12:15:48,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:48,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281564123] [2019-12-18 12:15:48,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:48,137 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-18 12:15:48,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281564123] [2019-12-18 12:15:48,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:48,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:15:48,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931173133] [2019-12-18 12:15:48,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:15:48,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:48,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:15:48,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:15:48,139 INFO L87 Difference]: Start difference. First operand 16461 states and 50424 transitions. Second operand 5 states. [2019-12-18 12:15:48,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:48,744 INFO L93 Difference]: Finished difference Result 27952 states and 83792 transitions. [2019-12-18 12:15:48,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:15:48,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:15:48,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:48,784 INFO L225 Difference]: With dead ends: 27952 [2019-12-18 12:15:48,785 INFO L226 Difference]: Without dead ends: 27952 [2019-12-18 12:15:48,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:15:48,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27952 states. [2019-12-18 12:15:49,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27952 to 22733. [2019-12-18 12:15:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22733 states. [2019-12-18 12:15:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22733 states to 22733 states and 69291 transitions. [2019-12-18 12:15:49,136 INFO L78 Accepts]: Start accepts. Automaton has 22733 states and 69291 transitions. Word has length 40 [2019-12-18 12:15:49,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:49,136 INFO L462 AbstractCegarLoop]: Abstraction has 22733 states and 69291 transitions. [2019-12-18 12:15:49,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:15:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand 22733 states and 69291 transitions. [2019-12-18 12:15:49,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:15:49,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:49,157 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-18 12:15:49,157 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-18 12:15:49,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:49,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2071452234, now seen corresponding path program 3 times [2019-12-18 12:15:49,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:49,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646994897] [2019-12-18 12:15:49,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:49,237 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-18 12:15:49,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646994897] [2019-12-18 12:15:49,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:49,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:15:49,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696881960] [2019-12-18 12:15:49,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:15:49,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:49,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:15:49,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:15:49,241 INFO L87 Difference]: Start difference. First operand 22733 states and 69291 transitions. Second operand 6 states. [2019-12-18 12:15:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:50,075 INFO L93 Difference]: Finished difference Result 38413 states and 116262 transitions. [2019-12-18 12:15:50,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 12:15:50,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 12:15:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:50,134 INFO L225 Difference]: With dead ends: 38413 [2019-12-18 12:15:50,135 INFO L226 Difference]: Without dead ends: 38413 [2019-12-18 12:15:50,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:15:50,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38413 states. [2019-12-18 12:15:50,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38413 to 26717. [2019-12-18 12:15:50,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26717 states. [2019-12-18 12:15:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26717 states to 26717 states and 81414 transitions. [2019-12-18 12:15:50,871 INFO L78 Accepts]: Start accepts. Automaton has 26717 states and 81414 transitions. Word has length 40 [2019-12-18 12:15:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:50,872 INFO L462 AbstractCegarLoop]: Abstraction has 26717 states and 81414 transitions. [2019-12-18 12:15:50,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:15:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 26717 states and 81414 transitions. [2019-12-18 12:15:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:15:50,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:50,899 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-18 12:15:50,899 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-18 12:15:50,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:50,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1944149328, now seen corresponding path program 4 times [2019-12-18 12:15:50,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:50,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240569801] [2019-12-18 12:15:50,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:50,953 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-18 12:15:50,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240569801] [2019-12-18 12:15:50,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:50,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:15:50,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901658706] [2019-12-18 12:15:50,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:15:50,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:50,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:15:50,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:15:50,955 INFO L87 Difference]: Start difference. First operand 26717 states and 81414 transitions. Second operand 5 states. [2019-12-18 12:15:51,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:51,055 INFO L93 Difference]: Finished difference Result 25359 states and 78201 transitions. [2019-12-18 12:15:51,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:15:51,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:15:51,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:51,088 INFO L225 Difference]: With dead ends: 25359 [2019-12-18 12:15:51,088 INFO L226 Difference]: Without dead ends: 23331 [2019-12-18 12:15:51,089 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-18 12:15:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23331 states. [2019-12-18 12:15:51,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23331 to 22246. [2019-12-18 12:15:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22246 states. [2019-12-18 12:15:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22246 states to 22246 states and 70322 transitions. [2019-12-18 12:15:51,426 INFO L78 Accepts]: Start accepts. Automaton has 22246 states and 70322 transitions. Word has length 40 [2019-12-18 12:15:51,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:51,426 INFO L462 AbstractCegarLoop]: Abstraction has 22246 states and 70322 transitions. [2019-12-18 12:15:51,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:15:51,426 INFO L276 IsEmpty]: Start isEmpty. Operand 22246 states and 70322 transitions. [2019-12-18 12:15:51,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:15:51,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:51,453 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-18 12:15:51,453 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-18 12:15:51,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:51,453 INFO L82 PathProgramCache]: Analyzing trace with hash 275512574, now seen corresponding path program 1 times [2019-12-18 12:15:51,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:51,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741944023] [2019-12-18 12:15:51,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:51,536 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-18 12:15:51,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741944023] [2019-12-18 12:15:51,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:51,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:15:51,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458176057] [2019-12-18 12:15:51,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:15:51,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:51,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:15:51,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:15:51,539 INFO L87 Difference]: Start difference. First operand 22246 states and 70322 transitions. Second operand 7 states. [2019-12-18 12:15:52,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:52,061 INFO L93 Difference]: Finished difference Result 72025 states and 224764 transitions. [2019-12-18 12:15:52,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:15:52,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:15:52,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:52,139 INFO L225 Difference]: With dead ends: 72025 [2019-12-18 12:15:52,140 INFO L226 Difference]: Without dead ends: 50174 [2019-12-18 12:15:52,140 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-18 12:15:52,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50174 states. [2019-12-18 12:15:53,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50174 to 25630. [2019-12-18 12:15:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25630 states. [2019-12-18 12:15:53,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25630 states to 25630 states and 81003 transitions. [2019-12-18 12:15:53,061 INFO L78 Accepts]: Start accepts. Automaton has 25630 states and 81003 transitions. Word has length 64 [2019-12-18 12:15:53,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:53,062 INFO L462 AbstractCegarLoop]: Abstraction has 25630 states and 81003 transitions. [2019-12-18 12:15:53,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:15:53,062 INFO L276 IsEmpty]: Start isEmpty. Operand 25630 states and 81003 transitions. [2019-12-18 12:15:53,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:15:53,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:53,093 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-18 12:15:53,093 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-18 12:15:53,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:53,094 INFO L82 PathProgramCache]: Analyzing trace with hash 474826606, now seen corresponding path program 2 times [2019-12-18 12:15:53,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:53,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456174579] [2019-12-18 12:15:53,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:53,204 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-18 12:15:53,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456174579] [2019-12-18 12:15:53,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:53,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:15:53,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186886555] [2019-12-18 12:15:53,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:15:53,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:53,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:15:53,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:15:53,206 INFO L87 Difference]: Start difference. First operand 25630 states and 81003 transitions. Second operand 8 states. [2019-12-18 12:15:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:54,575 INFO L93 Difference]: Finished difference Result 121805 states and 379916 transitions. [2019-12-18 12:15:54,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:15:54,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 12:15:54,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:54,711 INFO L225 Difference]: With dead ends: 121805 [2019-12-18 12:15:54,711 INFO L226 Difference]: Without dead ends: 83754 [2019-12-18 12:15:54,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 12:15:54,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83754 states. [2019-12-18 12:15:56,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83754 to 29901. [2019-12-18 12:15:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29901 states. [2019-12-18 12:15:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29901 states to 29901 states and 94342 transitions. [2019-12-18 12:15:56,059 INFO L78 Accepts]: Start accepts. Automaton has 29901 states and 94342 transitions. Word has length 64 [2019-12-18 12:15:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:56,060 INFO L462 AbstractCegarLoop]: Abstraction has 29901 states and 94342 transitions. [2019-12-18 12:15:56,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:15:56,060 INFO L276 IsEmpty]: Start isEmpty. Operand 29901 states and 94342 transitions. [2019-12-18 12:15:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:15:56,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:56,093 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-18 12:15:56,094 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-18 12:15:56,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:56,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1554423936, now seen corresponding path program 3 times [2019-12-18 12:15:56,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:56,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847556194] [2019-12-18 12:15:56,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:56,204 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-18 12:15:56,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847556194] [2019-12-18 12:15:56,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:56,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:15:56,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580638690] [2019-12-18 12:15:56,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:15:56,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:56,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:15:56,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:15:56,206 INFO L87 Difference]: Start difference. First operand 29901 states and 94342 transitions. Second operand 9 states. [2019-12-18 12:15:58,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:58,098 INFO L93 Difference]: Finished difference Result 183880 states and 570924 transitions. [2019-12-18 12:15:58,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 12:15:58,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:15:58,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:58,348 INFO L225 Difference]: With dead ends: 183880 [2019-12-18 12:15:58,348 INFO L226 Difference]: Without dead ends: 147650 [2019-12-18 12:15:58,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=363, Invalid=1043, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 12:15:58,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147650 states. [2019-12-18 12:16:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147650 to 36955. [2019-12-18 12:16:00,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36955 states. [2019-12-18 12:16:00,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36955 states to 36955 states and 116388 transitions. [2019-12-18 12:16:00,241 INFO L78 Accepts]: Start accepts. Automaton has 36955 states and 116388 transitions. Word has length 64 [2019-12-18 12:16:00,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:16:00,241 INFO L462 AbstractCegarLoop]: Abstraction has 36955 states and 116388 transitions. [2019-12-18 12:16:00,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:16:00,241 INFO L276 IsEmpty]: Start isEmpty. Operand 36955 states and 116388 transitions. [2019-12-18 12:16:00,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:16:00,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:16:00,282 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-18 12:16:00,282 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-18 12:16:00,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:16:00,283 INFO L82 PathProgramCache]: Analyzing trace with hash 85476954, now seen corresponding path program 4 times [2019-12-18 12:16:00,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:16:00,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228060017] [2019-12-18 12:16:00,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:16:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:16:00,398 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-18 12:16:00,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228060017] [2019-12-18 12:16:00,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:16:00,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:16:00,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11218777] [2019-12-18 12:16:00,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:16:00,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:16:00,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:16:00,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:16:00,400 INFO L87 Difference]: Start difference. First operand 36955 states and 116388 transitions. Second operand 9 states. [2019-12-18 12:16:02,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:16:02,424 INFO L93 Difference]: Finished difference Result 152885 states and 470048 transitions. [2019-12-18 12:16:02,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:16:02,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:16:02,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:16:03,237 INFO L225 Difference]: With dead ends: 152885 [2019-12-18 12:16:03,237 INFO L226 Difference]: Without dead ends: 136778 [2019-12-18 12:16:03,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=268, Invalid=788, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 12:16:03,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136778 states. [2019-12-18 12:16:04,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136778 to 36142. [2019-12-18 12:16:04,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36142 states. [2019-12-18 12:16:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36142 states to 36142 states and 113529 transitions. [2019-12-18 12:16:04,433 INFO L78 Accepts]: Start accepts. Automaton has 36142 states and 113529 transitions. Word has length 64 [2019-12-18 12:16:04,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:16:04,433 INFO L462 AbstractCegarLoop]: Abstraction has 36142 states and 113529 transitions. [2019-12-18 12:16:04,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:16:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 36142 states and 113529 transitions. [2019-12-18 12:16:04,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:16:04,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:16:04,475 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-18 12:16:04,475 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-18 12:16:04,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:16:04,475 INFO L82 PathProgramCache]: Analyzing trace with hash 812479892, now seen corresponding path program 5 times [2019-12-18 12:16:04,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:16:04,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849755325] [2019-12-18 12:16:04,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:16:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:16:04,551 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-18 12:16:04,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849755325] [2019-12-18 12:16:04,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:16:04,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:16:04,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922676816] [2019-12-18 12:16:04,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:16:04,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:16:04,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:16:04,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:16:04,553 INFO L87 Difference]: Start difference. First operand 36142 states and 113529 transitions. Second operand 7 states. [2019-12-18 12:16:05,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:16:05,093 INFO L93 Difference]: Finished difference Result 78673 states and 242006 transitions. [2019-12-18 12:16:05,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:16:05,094 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:16:05,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:16:05,201 INFO L225 Difference]: With dead ends: 78673 [2019-12-18 12:16:05,201 INFO L226 Difference]: Without dead ends: 67651 [2019-12-18 12:16:05,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:16:05,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67651 states. [2019-12-18 12:16:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67651 to 36206. [2019-12-18 12:16:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36206 states. [2019-12-18 12:16:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36206 states to 36206 states and 113658 transitions. [2019-12-18 12:16:06,374 INFO L78 Accepts]: Start accepts. Automaton has 36206 states and 113658 transitions. Word has length 64 [2019-12-18 12:16:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:16:06,374 INFO L462 AbstractCegarLoop]: Abstraction has 36206 states and 113658 transitions. [2019-12-18 12:16:06,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:16:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 36206 states and 113658 transitions. [2019-12-18 12:16:06,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:16:06,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:16:06,419 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-18 12:16:06,419 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-18 12:16:06,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:16:06,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1442601312, now seen corresponding path program 6 times [2019-12-18 12:16:06,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:16:06,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575665184] [2019-12-18 12:16:06,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:16:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:16:06,503 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-18 12:16:06,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575665184] [2019-12-18 12:16:06,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:16:06,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:16:06,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587867885] [2019-12-18 12:16:06,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:16:06,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:16:06,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:16:06,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:16:06,505 INFO L87 Difference]: Start difference. First operand 36206 states and 113658 transitions. Second operand 3 states. [2019-12-18 12:16:06,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:16:06,719 INFO L93 Difference]: Finished difference Result 43673 states and 135917 transitions. [2019-12-18 12:16:06,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:16:06,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:16:06,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:16:06,783 INFO L225 Difference]: With dead ends: 43673 [2019-12-18 12:16:06,783 INFO L226 Difference]: Without dead ends: 43673 [2019-12-18 12:16:06,784 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-18 12:16:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43673 states. [2019-12-18 12:16:07,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43673 to 37805. [2019-12-18 12:16:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37805 states. [2019-12-18 12:16:07,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37805 states to 37805 states and 118379 transitions. [2019-12-18 12:16:07,402 INFO L78 Accepts]: Start accepts. Automaton has 37805 states and 118379 transitions. Word has length 64 [2019-12-18 12:16:07,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:16:07,403 INFO L462 AbstractCegarLoop]: Abstraction has 37805 states and 118379 transitions. [2019-12-18 12:16:07,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:16:07,403 INFO L276 IsEmpty]: Start isEmpty. Operand 37805 states and 118379 transitions. [2019-12-18 12:16:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:16:07,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:16:07,447 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-18 12:16:07,447 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-18 12:16:07,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:16:07,448 INFO L82 PathProgramCache]: Analyzing trace with hash 318332456, now seen corresponding path program 1 times [2019-12-18 12:16:07,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:16:07,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028228049] [2019-12-18 12:16:07,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:16:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:16:07,550 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-18 12:16:07,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028228049] [2019-12-18 12:16:07,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:16:07,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:16:07,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854743089] [2019-12-18 12:16:07,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:16:07,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:16:07,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:16:07,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:16:07,552 INFO L87 Difference]: Start difference. First operand 37805 states and 118379 transitions. Second operand 8 states. [2019-12-18 12:16:08,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:16:08,995 INFO L93 Difference]: Finished difference Result 110886 states and 342679 transitions. [2019-12-18 12:16:09,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 12:16:09,000 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:16:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:16:09,174 INFO L225 Difference]: With dead ends: 110886 [2019-12-18 12:16:09,174 INFO L226 Difference]: Without dead ends: 104510 [2019-12-18 12:16:09,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 12:16:09,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104510 states. [2019-12-18 12:16:10,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104510 to 38340. [2019-12-18 12:16:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38340 states. [2019-12-18 12:16:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38340 states to 38340 states and 120322 transitions. [2019-12-18 12:16:10,305 INFO L78 Accepts]: Start accepts. Automaton has 38340 states and 120322 transitions. Word has length 65 [2019-12-18 12:16:10,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:16:10,306 INFO L462 AbstractCegarLoop]: Abstraction has 38340 states and 120322 transitions. [2019-12-18 12:16:10,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:16:10,306 INFO L276 IsEmpty]: Start isEmpty. Operand 38340 states and 120322 transitions. [2019-12-18 12:16:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:16:10,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:16:10,349 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-18 12:16:10,349 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-18 12:16:10,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:16:10,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1590918528, now seen corresponding path program 2 times [2019-12-18 12:16:10,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:16:10,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640059050] [2019-12-18 12:16:10,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:16:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:16:10,483 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-18 12:16:10,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640059050] [2019-12-18 12:16:10,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:16:10,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:16:10,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763089260] [2019-12-18 12:16:10,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:16:10,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:16:10,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:16:10,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:16:10,486 INFO L87 Difference]: Start difference. First operand 38340 states and 120322 transitions. Second operand 9 states. [2019-12-18 12:16:12,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:16:12,759 INFO L93 Difference]: Finished difference Result 163120 states and 501153 transitions. [2019-12-18 12:16:12,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 12:16:12,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:16:12,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:16:12,975 INFO L225 Difference]: With dead ends: 163120 [2019-12-18 12:16:12,975 INFO L226 Difference]: Without dead ends: 134485 [2019-12-18 12:16:12,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=767, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 12:16:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134485 states. [2019-12-18 12:16:14,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134485 to 40212. [2019-12-18 12:16:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40212 states. [2019-12-18 12:16:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40212 states to 40212 states and 125303 transitions. [2019-12-18 12:16:14,338 INFO L78 Accepts]: Start accepts. Automaton has 40212 states and 125303 transitions. Word has length 65 [2019-12-18 12:16:14,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:16:14,338 INFO L462 AbstractCegarLoop]: Abstraction has 40212 states and 125303 transitions. [2019-12-18 12:16:14,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:16:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 40212 states and 125303 transitions. [2019-12-18 12:16:14,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:16:14,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:16:14,382 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-18 12:16:14,382 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-18 12:16:14,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:16:14,383 INFO L82 PathProgramCache]: Analyzing trace with hash 704301340, now seen corresponding path program 3 times [2019-12-18 12:16:14,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:16:14,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532563780] [2019-12-18 12:16:14,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:16:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:16:14,477 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-18 12:16:14,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532563780] [2019-12-18 12:16:14,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:16:14,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:16:14,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704797659] [2019-12-18 12:16:14,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:16:14,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:16:14,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:16:14,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:16:14,479 INFO L87 Difference]: Start difference. First operand 40212 states and 125303 transitions. Second operand 9 states. [2019-12-18 12:16:16,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:16:16,367 INFO L93 Difference]: Finished difference Result 132812 states and 405190 transitions. [2019-12-18 12:16:16,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:16:16,368 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 12:16:16,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:16:16,564 INFO L225 Difference]: With dead ends: 132812 [2019-12-18 12:16:16,564 INFO L226 Difference]: Without dead ends: 124029 [2019-12-18 12:16:16,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=607, Unknown=0, NotChecked=0, Total=812 [2019-12-18 12:16:16,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124029 states. [2019-12-18 12:16:17,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124029 to 38469. [2019-12-18 12:16:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38469 states. [2019-12-18 12:16:17,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38469 states to 38469 states and 120398 transitions. [2019-12-18 12:16:17,864 INFO L78 Accepts]: Start accepts. Automaton has 38469 states and 120398 transitions. Word has length 65 [2019-12-18 12:16:17,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:16:17,865 INFO L462 AbstractCegarLoop]: Abstraction has 38469 states and 120398 transitions. [2019-12-18 12:16:17,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:16:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 38469 states and 120398 transitions. [2019-12-18 12:16:17,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:16:17,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:16:17,908 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-18 12:16:17,908 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-18 12:16:17,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:16:17,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1422061222, now seen corresponding path program 1 times [2019-12-18 12:16:17,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:16:17,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032396439] [2019-12-18 12:16:17,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:16:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:16:18,005 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-18 12:16:18,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032396439] [2019-12-18 12:16:18,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:16:18,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:16:18,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359747346] [2019-12-18 12:16:18,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:16:18,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:16:18,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:16:18,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:16:18,008 INFO L87 Difference]: Start difference. First operand 38469 states and 120398 transitions. Second operand 7 states. [2019-12-18 12:16:19,010 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-18 12:16:19,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:16:19,824 INFO L93 Difference]: Finished difference Result 72617 states and 222939 transitions. [2019-12-18 12:16:19,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:16:19,824 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:16:19,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:16:19,939 INFO L225 Difference]: With dead ends: 72617 [2019-12-18 12:16:19,939 INFO L226 Difference]: Without dead ends: 72617 [2019-12-18 12:16:19,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:16:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72617 states. [2019-12-18 12:16:20,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72617 to 39272. [2019-12-18 12:16:20,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39272 states. [2019-12-18 12:16:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39272 states to 39272 states and 122780 transitions. [2019-12-18 12:16:20,810 INFO L78 Accepts]: Start accepts. Automaton has 39272 states and 122780 transitions. Word has length 65 [2019-12-18 12:16:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:16:20,810 INFO L462 AbstractCegarLoop]: Abstraction has 39272 states and 122780 transitions. [2019-12-18 12:16:20,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:16:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 39272 states and 122780 transitions. [2019-12-18 12:16:20,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:16:20,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:16:20,855 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-18 12:16:20,855 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-18 12:16:20,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:16:20,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1551355630, now seen corresponding path program 4 times [2019-12-18 12:16:20,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:16:20,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819567611] [2019-12-18 12:16:20,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:16:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:16:20,942 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-18 12:16:20,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819567611] [2019-12-18 12:16:20,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:16:20,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:16:20,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726680030] [2019-12-18 12:16:20,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:16:20,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:16:20,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:16:20,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:16:20,944 INFO L87 Difference]: Start difference. First operand 39272 states and 122780 transitions. Second operand 7 states. [2019-12-18 12:16:22,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:16:22,485 INFO L93 Difference]: Finished difference Result 71507 states and 217949 transitions. [2019-12-18 12:16:22,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 12:16:22,485 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 12:16:22,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:16:22,596 INFO L225 Difference]: With dead ends: 71507 [2019-12-18 12:16:22,596 INFO L226 Difference]: Without dead ends: 71507 [2019-12-18 12:16:22,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-18 12:16:22,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71507 states. [2019-12-18 12:16:23,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71507 to 40699. [2019-12-18 12:16:23,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40699 states. [2019-12-18 12:16:23,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40699 states to 40699 states and 126651 transitions. [2019-12-18 12:16:23,757 INFO L78 Accepts]: Start accepts. Automaton has 40699 states and 126651 transitions. Word has length 65 [2019-12-18 12:16:23,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:16:23,757 INFO L462 AbstractCegarLoop]: Abstraction has 40699 states and 126651 transitions. [2019-12-18 12:16:23,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:16:23,757 INFO L276 IsEmpty]: Start isEmpty. Operand 40699 states and 126651 transitions. [2019-12-18 12:16:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:16:23,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:16:23,801 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-18 12:16:23,801 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-18 12:16:23,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:16:23,802 INFO L82 PathProgramCache]: Analyzing trace with hash 372067404, now seen corresponding path program 2 times [2019-12-18 12:16:23,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:16:23,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160293052] [2019-12-18 12:16:23,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:16:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:16:23,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-18 12:16:23,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160293052] [2019-12-18 12:16:23,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:16:23,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:16:23,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852710814] [2019-12-18 12:16:23,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:16:23,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:16:23,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:16:23,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:16:23,932 INFO L87 Difference]: Start difference. First operand 40699 states and 126651 transitions. Second operand 8 states. [2019-12-18 12:16:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:16:25,789 INFO L93 Difference]: Finished difference Result 83238 states and 255936 transitions. [2019-12-18 12:16:25,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:16:25,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 12:16:25,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:16:25,923 INFO L225 Difference]: With dead ends: 83238 [2019-12-18 12:16:25,923 INFO L226 Difference]: Without dead ends: 83238 [2019-12-18 12:16:25,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:16:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83238 states. [2019-12-18 12:16:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83238 to 43093. [2019-12-18 12:16:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43093 states. [2019-12-18 12:16:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43093 states to 43093 states and 135136 transitions. [2019-12-18 12:16:27,382 INFO L78 Accepts]: Start accepts. Automaton has 43093 states and 135136 transitions. Word has length 65 [2019-12-18 12:16:27,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:16:27,382 INFO L462 AbstractCegarLoop]: Abstraction has 43093 states and 135136 transitions. [2019-12-18 12:16:27,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:16:27,383 INFO L276 IsEmpty]: Start isEmpty. Operand 43093 states and 135136 transitions. [2019-12-18 12:16:27,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:16:27,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:16:27,432 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-18 12:16:27,432 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-18 12:16:27,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:16:27,432 INFO L82 PathProgramCache]: Analyzing trace with hash 140793632, now seen corresponding path program 3 times [2019-12-18 12:16:27,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:16:27,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897832398] [2019-12-18 12:16:27,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:16:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:16:27,494 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-18 12:16:27,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897832398] [2019-12-18 12:16:27,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:16:27,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:16:27,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192115761] [2019-12-18 12:16:27,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:16:27,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:16:27,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:16:27,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:16:27,498 INFO L87 Difference]: Start difference. First operand 43093 states and 135136 transitions. Second operand 3 states. [2019-12-18 12:16:27,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:16:27,724 INFO L93 Difference]: Finished difference Result 43093 states and 135135 transitions. [2019-12-18 12:16:27,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:16:27,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:16:27,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:16:27,838 INFO L225 Difference]: With dead ends: 43093 [2019-12-18 12:16:27,838 INFO L226 Difference]: Without dead ends: 43093 [2019-12-18 12:16:27,842 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-18 12:16:28,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43093 states. [2019-12-18 12:16:28,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43093 to 31980. [2019-12-18 12:16:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31980 states. [2019-12-18 12:16:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31980 states to 31980 states and 100810 transitions. [2019-12-18 12:16:28,595 INFO L78 Accepts]: Start accepts. Automaton has 31980 states and 100810 transitions. Word has length 65 [2019-12-18 12:16:28,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:16:28,595 INFO L462 AbstractCegarLoop]: Abstraction has 31980 states and 100810 transitions. [2019-12-18 12:16:28,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:16:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 31980 states and 100810 transitions. [2019-12-18 12:16:28,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:16:28,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:16:28,632 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-18 12:16:28,632 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-18 12:16:28,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:16:28,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1242482118, now seen corresponding path program 1 times [2019-12-18 12:16:28,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:16:28,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214129604] [2019-12-18 12:16:28,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:16:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:16:28,723 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-18 12:16:28,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214129604] [2019-12-18 12:16:28,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:16:28,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:16:28,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230585413] [2019-12-18 12:16:28,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:16:28,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:16:28,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:16:28,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:16:28,725 INFO L87 Difference]: Start difference. First operand 31980 states and 100810 transitions. Second operand 8 states. [2019-12-18 12:16:30,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:16:30,928 INFO L93 Difference]: Finished difference Result 58825 states and 182632 transitions. [2019-12-18 12:16:30,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 12:16:30,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 12:16:30,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:16:31,022 INFO L225 Difference]: With dead ends: 58825 [2019-12-18 12:16:31,022 INFO L226 Difference]: Without dead ends: 58825 [2019-12-18 12:16:31,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2019-12-18 12:16:31,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58825 states. [2019-12-18 12:16:31,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58825 to 31833. [2019-12-18 12:16:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31833 states. [2019-12-18 12:16:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31833 states to 31833 states and 100313 transitions. [2019-12-18 12:16:32,028 INFO L78 Accepts]: Start accepts. Automaton has 31833 states and 100313 transitions. Word has length 66 [2019-12-18 12:16:32,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:16:32,029 INFO L462 AbstractCegarLoop]: Abstraction has 31833 states and 100313 transitions. [2019-12-18 12:16:32,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:16:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 31833 states and 100313 transitions. [2019-12-18 12:16:32,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:16:32,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:16:32,064 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-18 12:16:32,064 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-18 12:16:32,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:16:32,065 INFO L82 PathProgramCache]: Analyzing trace with hash -927878062, now seen corresponding path program 2 times [2019-12-18 12:16:32,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:16:32,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946141886] [2019-12-18 12:16:32,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:16:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:16:32,113 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-18 12:16:32,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946141886] [2019-12-18 12:16:32,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:16:32,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:16:32,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868448906] [2019-12-18 12:16:32,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:16:32,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:16:32,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:16:32,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:16:32,115 INFO L87 Difference]: Start difference. First operand 31833 states and 100313 transitions. Second operand 3 states. [2019-12-18 12:16:32,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:16:32,214 INFO L93 Difference]: Finished difference Result 23212 states and 72688 transitions. [2019-12-18 12:16:32,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:16:32,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:16:32,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:16:32,258 INFO L225 Difference]: With dead ends: 23212 [2019-12-18 12:16:32,258 INFO L226 Difference]: Without dead ends: 23212 [2019-12-18 12:16:32,259 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-18 12:16:32,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23212 states. [2019-12-18 12:16:32,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23212 to 20876. [2019-12-18 12:16:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20876 states. [2019-12-18 12:16:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20876 states to 20876 states and 65082 transitions. [2019-12-18 12:16:32,838 INFO L78 Accepts]: Start accepts. Automaton has 20876 states and 65082 transitions. Word has length 66 [2019-12-18 12:16:32,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:16:32,839 INFO L462 AbstractCegarLoop]: Abstraction has 20876 states and 65082 transitions. [2019-12-18 12:16:32,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:16:32,839 INFO L276 IsEmpty]: Start isEmpty. Operand 20876 states and 65082 transitions. [2019-12-18 12:16:32,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:16:32,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:16:32,865 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-18 12:16:32,865 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-18 12:16:32,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:16:32,865 INFO L82 PathProgramCache]: Analyzing trace with hash 763340387, now seen corresponding path program 1 times [2019-12-18 12:16:32,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:16:32,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65194554] [2019-12-18 12:16:32,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:16:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:16:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:16:32,984 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:16:32,985 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:16:32,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~z$r_buff0_thd3~0_367) (= v_~z$r_buff0_thd0~0_147 0) (= v_~z$w_buff0_used~0_850 0) (= v_~z$w_buff0~0_393 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_322) (= v_~weak$$choice2~0_147 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t165~0.base_27|) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd1~0_158 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t165~0.base_27| 4)) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_168 0) (= v_~z$w_buff1_used~0_568 0) (= v_~main$tmp_guard1~0_41 0) (= |v_ULTIMATE.start_main_~#t165~0.offset_17| 0) (= 0 v_~__unbuffered_p2_EAX~0_41) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_26) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= v_~z$r_buff0_thd1~0_210 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t165~0.base_27| 1)) (= 0 v_~x~0_154) (= v_~z$r_buff0_thd2~0_129 0) (= 0 v_~__unbuffered_cnt~0_88) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t165~0.base_27| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t165~0.base_27|) |v_ULTIMATE.start_main_~#t165~0.offset_17| 0)) |v_#memory_int_19|) (= v_~z~0_181 0) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t165~0.base_27|)) (= v_~y~0_31 0) (= v_~z$r_buff1_thd0~0_191 0) (= v_~z$w_buff1~0_253 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_168, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_61|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_191|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ULTIMATE.start_main_~#t167~0.offset=|v_ULTIMATE.start_main_~#t167~0.offset_17|, ULTIMATE.start_main_~#t166~0.offset=|v_ULTIMATE.start_main_~#t166~0.offset_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_568, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ULTIMATE.start_main_~#t165~0.base=|v_ULTIMATE.start_main_~#t165~0.base_27|, ~weak$$choice0~0=v_~weak$$choice0~0_13, ULTIMATE.start_main_~#t165~0.offset=|v_ULTIMATE.start_main_~#t165~0.offset_17|, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t166~0.base=|v_ULTIMATE.start_main_~#t166~0.base_22|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_158, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_367, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~x~0=v_~x~0_154, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_253, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_39|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_43|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_191, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_129, ULTIMATE.start_main_~#t167~0.base=|v_ULTIMATE.start_main_~#t167~0.base_23|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_850, ~z$w_buff0~0=v_~z$w_buff0~0_393, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_322, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_181, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_210} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t167~0.offset, ULTIMATE.start_main_~#t166~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t165~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t165~0.offset, ULTIMATE.start_main_~#t166~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t167~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:16:32,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L830-1-->L832: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t166~0.base_11| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t166~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t166~0.base_11|) |v_ULTIMATE.start_main_~#t166~0.offset_9| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t166~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t166~0.base_11|) (= |v_ULTIMATE.start_main_~#t166~0.offset_9| 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t166~0.base_11| 1)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t166~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t166~0.offset=|v_ULTIMATE.start_main_~#t166~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t166~0.base=|v_ULTIMATE.start_main_~#t166~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t166~0.offset, ULTIMATE.start_main_~#t166~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 12:16:32,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->L748: Formula: (and (= v_~z$r_buff0_thd0~0_17 v_~z$r_buff1_thd0~0_13) (= 1 v_~x~0_6) (= v_~z$r_buff0_thd1~0_21 1) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_31) (= v_~z$r_buff0_thd1~0_22 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_31, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_13, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_21, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 12:16:32,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In397581281 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In397581281 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out397581281| ~z$w_buff1~0_In397581281)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out397581281| ~z~0_In397581281)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In397581281, ~z$w_buff1_used~0=~z$w_buff1_used~0_In397581281, ~z$w_buff1~0=~z$w_buff1~0_In397581281, ~z~0=~z~0_In397581281} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out397581281|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In397581281, ~z$w_buff1_used~0=~z$w_buff1_used~0_In397581281, ~z$w_buff1~0=~z$w_buff1~0_In397581281, ~z~0=~z~0_In397581281} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 12:16:32,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L771-4-->L772: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_12| v_~z~0_27) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_12|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_11|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_17|, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 12:16:32,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-95572696 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-95572696 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-95572696|)) (and (= ~z$w_buff0_used~0_In-95572696 |P1Thread1of1ForFork2_#t~ite11_Out-95572696|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-95572696, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-95572696} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-95572696, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-95572696|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-95572696} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:16:32,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In1037556026 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1037556026 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In1037556026 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1037556026 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1037556026 |P1Thread1of1ForFork2_#t~ite12_Out1037556026|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out1037556026|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1037556026, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1037556026, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1037556026, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1037556026} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1037556026, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1037556026, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1037556026, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1037556026|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1037556026} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:16:32,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t167~0.base_9|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t167~0.base_9| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t167~0.offset_8| 0) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t167~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t167~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t167~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t167~0.base_9|) |v_ULTIMATE.start_main_~#t167~0.offset_8| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t167~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t167~0.offset=|v_ULTIMATE.start_main_~#t167~0.offset_8|, ULTIMATE.start_main_~#t167~0.base=|v_ULTIMATE.start_main_~#t167~0.base_9|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t167~0.offset, ULTIMATE.start_main_~#t167~0.base] because there is no mapped edge [2019-12-18 12:16:32,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1432227935 256)))) (or (and (= ~z$w_buff0~0_In1432227935 |P2Thread1of1ForFork0_#t~ite21_Out1432227935|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In1432227935| |P2Thread1of1ForFork0_#t~ite20_Out1432227935|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1432227935 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In1432227935 256)) .cse1) (= (mod ~z$w_buff0_used~0_In1432227935 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In1432227935 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite20_Out1432227935| ~z$w_buff0~0_In1432227935) .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out1432227935| |P2Thread1of1ForFork0_#t~ite21_Out1432227935|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1432227935, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1432227935, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1432227935, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1432227935, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1432227935, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1432227935|, ~weak$$choice2~0=~weak$$choice2~0_In1432227935} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1432227935|, ~z$w_buff0~0=~z$w_buff0~0_In1432227935, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1432227935, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1432227935, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1432227935, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1432227935, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1432227935|, ~weak$$choice2~0=~weak$$choice2~0_In1432227935} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:16:32,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1290994840 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1290994840 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out1290994840| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out1290994840| ~z$r_buff0_thd2~0_In1290994840)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1290994840, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1290994840} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1290994840, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1290994840|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1290994840} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:16:32,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In735838118 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In735838118 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In735838118 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In735838118 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out735838118|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In735838118 |P1Thread1of1ForFork2_#t~ite14_Out735838118|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In735838118, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In735838118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In735838118, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In735838118} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In735838118, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In735838118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In735838118, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out735838118|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In735838118} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:16:32,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L775-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P1Thread1of1ForFork2_#t~ite14_32| v_~z$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_32|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_31|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:16:32,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In170677124 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_In170677124| |P2Thread1of1ForFork0_#t~ite23_Out170677124|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite24_Out170677124| ~z$w_buff1~0_In170677124)) (and (= |P2Thread1of1ForFork0_#t~ite24_Out170677124| |P2Thread1of1ForFork0_#t~ite23_Out170677124|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In170677124 256) 0))) (or (and (= 0 (mod ~z$w_buff1_used~0_In170677124 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In170677124 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In170677124 256))))) (= |P2Thread1of1ForFork0_#t~ite23_Out170677124| ~z$w_buff1~0_In170677124)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In170677124, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In170677124, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In170677124|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In170677124, ~z$w_buff1~0=~z$w_buff1~0_In170677124, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In170677124, ~weak$$choice2~0=~weak$$choice2~0_In170677124} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In170677124, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out170677124|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In170677124, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out170677124|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In170677124, ~z$w_buff1~0=~z$w_buff1~0_In170677124, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In170677124, ~weak$$choice2~0=~weak$$choice2~0_In170677124} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 12:16:32,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L798-->L798-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-15389930 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-15389930 256) 0))) (or (and .cse0 (= (mod ~z$w_buff1_used~0_In-15389930 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-15389930 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In-15389930 256)) .cse0))) (= |P2Thread1of1ForFork0_#t~ite27_Out-15389930| |P2Thread1of1ForFork0_#t~ite26_Out-15389930|) (= |P2Thread1of1ForFork0_#t~ite26_Out-15389930| ~z$w_buff0_used~0_In-15389930) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite26_In-15389930| |P2Thread1of1ForFork0_#t~ite26_Out-15389930|) (= |P2Thread1of1ForFork0_#t~ite27_Out-15389930| ~z$w_buff0_used~0_In-15389930)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-15389930|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-15389930, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-15389930, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-15389930, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-15389930, ~weak$$choice2~0=~weak$$choice2~0_In-15389930} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-15389930|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-15389930|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-15389930, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-15389930, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-15389930, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-15389930, ~weak$$choice2~0=~weak$$choice2~0_In-15389930} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 12:16:33,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff0_thd3~0_66)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 12:16:33,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L803-->L807: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= v_~z~0_50 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 12:16:33,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1315854447 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1315854447 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1315854447| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1315854447 |P0Thread1of1ForFork1_#t~ite5_Out-1315854447|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1315854447, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1315854447} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1315854447|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1315854447, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1315854447} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:16:33,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1387410755 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1387410755 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1387410755| ~z~0_In1387410755)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1387410755| ~z$w_buff1~0_In1387410755) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1387410755, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1387410755, ~z$w_buff1~0=~z$w_buff1~0_In1387410755, ~z~0=~z~0_In1387410755} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1387410755|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1387410755, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1387410755, ~z$w_buff1~0=~z$w_buff1~0_In1387410755, ~z~0=~z~0_In1387410755} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:16:33,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1214178082 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1214178082 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In1214178082 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1214178082 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1214178082 |P0Thread1of1ForFork1_#t~ite6_Out1214178082|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1214178082|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1214178082, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1214178082, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1214178082, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1214178082} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1214178082, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1214178082|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1214178082, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1214178082, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1214178082} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:16:33,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L751-->L752: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In100132569 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In100132569 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In100132569 ~z$r_buff0_thd1~0_Out100132569) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out100132569) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In100132569, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In100132569} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In100132569, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out100132569|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out100132569} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:16:33,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In-561242297 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-561242297 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-561242297 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-561242297 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-561242297| ~z$r_buff1_thd1~0_In-561242297) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-561242297|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-561242297, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-561242297, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-561242297, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-561242297} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-561242297|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-561242297, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-561242297, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-561242297, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-561242297} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:16:33,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L752-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_32|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_31|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:16:33,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L807-4-->L808: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-18 12:16:33,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1895579132 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1895579132 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1895579132|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1895579132 |P2Thread1of1ForFork0_#t~ite40_Out-1895579132|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1895579132, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1895579132} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1895579132, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1895579132|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1895579132} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:16:33,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1376933276 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1376933276 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1376933276 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1376933276 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-1376933276| ~z$w_buff1_used~0_In-1376933276) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-1376933276| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1376933276, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1376933276, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1376933276, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1376933276} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1376933276, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1376933276, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1376933276, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1376933276, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1376933276|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:16:33,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-612512311 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-612512311 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-612512311| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-612512311| ~z$r_buff0_thd3~0_In-612512311) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-612512311, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-612512311} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-612512311, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-612512311, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-612512311|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:16:33,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In716087381 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In716087381 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In716087381 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In716087381 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out716087381| ~z$r_buff1_thd3~0_In716087381) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out716087381| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In716087381, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In716087381, ~z$w_buff1_used~0=~z$w_buff1_used~0_In716087381, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In716087381} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out716087381|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In716087381, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In716087381, ~z$w_buff1_used~0=~z$w_buff1_used~0_In716087381, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In716087381} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:16:33,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_121 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_121, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:16:33,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L834-1-->L840: Formula: (and (= v_~main$tmp_guard0~0_11 1) (= 3 v_~__unbuffered_cnt~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:16:33,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L840-2-->L840-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite47_Out1729081293| |ULTIMATE.start_main_#t~ite48_Out1729081293|)) (.cse2 (= (mod ~z$w_buff1_used~0_In1729081293 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1729081293 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out1729081293| ~z$w_buff1~0_In1729081293) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite47_Out1729081293| ~z~0_In1729081293) .cse1 (or .cse2 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1729081293, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1729081293, ~z$w_buff1~0=~z$w_buff1~0_In1729081293, ~z~0=~z~0_In1729081293} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1729081293, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1729081293|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1729081293, ~z$w_buff1~0=~z$w_buff1~0_In1729081293, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1729081293|, ~z~0=~z~0_In1729081293} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:16:33,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1607855401 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1607855401 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out1607855401| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite49_Out1607855401| ~z$w_buff0_used~0_In1607855401)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1607855401, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1607855401} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1607855401, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1607855401, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1607855401|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:16:33,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In421473573 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In421473573 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In421473573 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In421473573 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out421473573| ~z$w_buff1_used~0_In421473573) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite50_Out421473573| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In421473573, ~z$w_buff0_used~0=~z$w_buff0_used~0_In421473573, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In421473573, ~z$w_buff1_used~0=~z$w_buff1_used~0_In421473573} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out421473573|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In421473573, ~z$w_buff0_used~0=~z$w_buff0_used~0_In421473573, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In421473573, ~z$w_buff1_used~0=~z$w_buff1_used~0_In421473573} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:16:33,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1920973759 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1920973759 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1920973759|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1920973759 |ULTIMATE.start_main_#t~ite51_Out-1920973759|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1920973759, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1920973759} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1920973759, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1920973759|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1920973759} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:16:33,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In979547575 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In979547575 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In979547575 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In979547575 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out979547575|)) (and (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In979547575 |ULTIMATE.start_main_#t~ite52_Out979547575|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In979547575, ~z$w_buff0_used~0=~z$w_buff0_used~0_In979547575, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In979547575, ~z$w_buff1_used~0=~z$w_buff1_used~0_In979547575} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out979547575|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In979547575, ~z$w_buff0_used~0=~z$w_buff0_used~0_In979547575, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In979547575, ~z$w_buff1_used~0=~z$w_buff1_used~0_In979547575} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:16:33,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_18 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 2 v_~__unbuffered_p1_EAX~0_22) (= v_~x~0_65 2) (= v_~__unbuffered_p2_EBX~0_27 0) (= v_~z$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~__unbuffered_p1_EBX~0_23 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_101, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:16:33,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:16:33 BasicIcfg [2019-12-18 12:16:33,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:16:33,096 INFO L168 Benchmark]: Toolchain (without parser) took 125794.87 ms. Allocated memory was 145.2 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 102.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 12:16:33,097 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 12:16:33,097 INFO L168 Benchmark]: CACSL2BoogieTranslator took 842.09 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.7 MB in the beginning and 156.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:16:33,098 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.07 ms. Allocated memory is still 202.9 MB. Free memory was 155.4 MB in the beginning and 153.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:16:33,098 INFO L168 Benchmark]: Boogie Preprocessor took 40.97 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:16:33,099 INFO L168 Benchmark]: RCFGBuilder took 859.43 ms. Allocated memory is still 202.9 MB. Free memory was 150.7 MB in the beginning and 99.7 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:16:33,099 INFO L168 Benchmark]: TraceAbstraction took 123983.80 ms. Allocated memory was 202.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 99.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-18 12:16:33,102 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.48 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 842.09 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.7 MB in the beginning and 156.1 MB in the end (delta: -54.4 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.07 ms. Allocated memory is still 202.9 MB. Free memory was 155.4 MB in the beginning and 153.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.97 ms. Allocated memory is still 202.9 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 859.43 ms. Allocated memory is still 202.9 MB. Free memory was 150.7 MB in the beginning and 99.7 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 123983.80 ms. Allocated memory was 202.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 99.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7398 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 70 SemBasedMoverChecksPositive, 270 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 78628 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = x [L768] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L834] FCALL, FORK 0 pthread_create(&t167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 y = 1 [L788] 3 __unbuffered_p2_EAX = y [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 z$flush_delayed = weak$$choice2 [L794] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L796] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L773] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L774] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L798] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L807] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L810] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L843] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 123.6s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 46.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8524 SDtfs, 14606 SDslu, 24273 SDs, 0 SdLazy, 15604 SolverSat, 981 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 517 GetRequests, 82 SyntacticMatches, 18 SemanticMatches, 417 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2301 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146095occurred 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: 49.6s AutomataMinimizationTime, 32 MinimizatonAttempts, 956477 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1516 NumberOfCodeBlocks, 1516 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1417 ConstructedInterpolants, 0 QuantifiedInterpolants, 259434 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...