/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix006_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 15:40:15,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 15:40:15,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 15:40:15,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 15:40:15,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 15:40:15,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 15:40:15,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 15:40:15,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 15:40:15,091 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 15:40:15,092 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 15:40:15,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 15:40:15,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 15:40:15,097 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 15:40:15,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 15:40:15,099 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 15:40:15,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 15:40:15,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 15:40:15,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 15:40:15,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 15:40:15,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 15:40:15,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 15:40:15,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 15:40:15,119 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 15:40:15,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 15:40:15,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 15:40:15,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 15:40:15,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 15:40:15,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 15:40:15,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 15:40:15,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 15:40:15,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 15:40:15,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 15:40:15,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 15:40:15,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 15:40:15,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 15:40:15,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 15:40:15,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 15:40:15,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 15:40:15,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 15:40:15,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 15:40:15,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 15:40:15,141 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 15:40:15,160 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 15:40:15,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 15:40:15,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 15:40:15,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 15:40:15,162 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 15:40:15,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 15:40:15,162 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 15:40:15,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 15:40:15,162 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 15:40:15,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 15:40:15,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 15:40:15,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 15:40:15,163 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 15:40:15,163 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 15:40:15,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 15:40:15,164 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 15:40:15,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 15:40:15,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 15:40:15,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 15:40:15,165 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 15:40:15,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 15:40:15,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:40:15,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 15:40:15,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 15:40:15,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 15:40:15,166 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 15:40:15,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 15:40:15,167 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 15:40:15,167 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 15:40:15,167 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 15:40:15,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 15:40:15,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 15:40:15,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 15:40:15,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 15:40:15,491 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 15:40:15,492 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 15:40:15,493 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_pso.oepc.i [2019-12-27 15:40:15,551 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094e89c6d/ce0ab97789c6483490bc79e41f08d2ac/FLAG78f670750 [2019-12-27 15:40:16,090 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 15:40:16,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_pso.oepc.i [2019-12-27 15:40:16,114 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094e89c6d/ce0ab97789c6483490bc79e41f08d2ac/FLAG78f670750 [2019-12-27 15:40:16,410 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094e89c6d/ce0ab97789c6483490bc79e41f08d2ac [2019-12-27 15:40:16,418 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 15:40:16,420 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 15:40:16,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 15:40:16,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 15:40:16,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 15:40:16,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:40:16" (1/1) ... [2019-12-27 15:40:16,429 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78428862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:16, skipping insertion in model container [2019-12-27 15:40:16,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:40:16" (1/1) ... [2019-12-27 15:40:16,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 15:40:16,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 15:40:17,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:40:17,052 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 15:40:17,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 15:40:17,194 INFO L208 MainTranslator]: Completed translation [2019-12-27 15:40:17,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:17 WrapperNode [2019-12-27 15:40:17,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 15:40:17,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 15:40:17,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 15:40:17,196 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 15:40:17,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:17" (1/1) ... [2019-12-27 15:40:17,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:17" (1/1) ... [2019-12-27 15:40:17,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 15:40:17,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 15:40:17,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 15:40:17,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 15:40:17,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:17" (1/1) ... [2019-12-27 15:40:17,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:17" (1/1) ... [2019-12-27 15:40:17,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:17" (1/1) ... [2019-12-27 15:40:17,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:17" (1/1) ... [2019-12-27 15:40:17,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:17" (1/1) ... [2019-12-27 15:40:17,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:17" (1/1) ... [2019-12-27 15:40:17,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:17" (1/1) ... [2019-12-27 15:40:17,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 15:40:17,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 15:40:17,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 15:40:17,330 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 15:40:17,331 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 15:40:17,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 15:40:17,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 15:40:17,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 15:40:17,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 15:40:17,413 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 15:40:17,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 15:40:17,414 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 15:40:17,414 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 15:40:17,415 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 15:40:17,415 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 15:40:17,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 15:40:17,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 15:40:17,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 15:40:17,418 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 15:40:18,278 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 15:40:18,279 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 15:40:18,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:40:18 BoogieIcfgContainer [2019-12-27 15:40:18,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 15:40:18,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 15:40:18,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 15:40:18,285 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 15:40:18,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:40:16" (1/3) ... [2019-12-27 15:40:18,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c72cf82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:40:18, skipping insertion in model container [2019-12-27 15:40:18,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:40:17" (2/3) ... [2019-12-27 15:40:18,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c72cf82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:40:18, skipping insertion in model container [2019-12-27 15:40:18,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:40:18" (3/3) ... [2019-12-27 15:40:18,290 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_pso.oepc.i [2019-12-27 15:40:18,300 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 15:40:18,301 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 15:40:18,309 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 15:40:18,310 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 15:40:18,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,377 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,378 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,378 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,379 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,379 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,384 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,388 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,388 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,403 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,403 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,403 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,404 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,409 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,410 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,429 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,430 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,431 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,432 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,433 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,434 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,449 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,452 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,466 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,466 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,467 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,469 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,469 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 15:40:18,489 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 15:40:18,506 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 15:40:18,506 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 15:40:18,506 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 15:40:18,506 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 15:40:18,507 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 15:40:18,507 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 15:40:18,507 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 15:40:18,507 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 15:40:18,523 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 15:40:18,525 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 15:40:18,658 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 15:40:18,658 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:40:18,682 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. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:40:18,708 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 15:40:18,800 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 15:40:18,800 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 15:40:18,808 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. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 15:40:18,830 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 15:40:18,831 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 15:40:24,242 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 15:40:24,386 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 15:40:24,408 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78628 [2019-12-27 15:40:24,408 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 15:40:24,412 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 15:40:42,757 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 110182 states. [2019-12-27 15:40:42,759 INFO L276 IsEmpty]: Start isEmpty. Operand 110182 states. [2019-12-27 15:40:42,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 15:40:42,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:42,765 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 15:40:42,765 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:42,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:42,769 INFO L82 PathProgramCache]: Analyzing trace with hash 917838, now seen corresponding path program 1 times [2019-12-27 15:40:42,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:42,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746696288] [2019-12-27 15:40:42,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:40:42,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746696288] [2019-12-27 15:40:42,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:42,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:40:42,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1039242376] [2019-12-27 15:40:42,981 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:42,986 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:42,998 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 15:40:42,998 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:43,002 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:40:43,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:40:43,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:43,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:40:43,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:40:43,018 INFO L87 Difference]: Start difference. First operand 110182 states. Second operand 3 states. [2019-12-27 15:40:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:40:44,200 INFO L93 Difference]: Finished difference Result 109312 states and 463550 transitions. [2019-12-27 15:40:44,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:40:44,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 15:40:44,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:40:47,807 INFO L225 Difference]: With dead ends: 109312 [2019-12-27 15:40:47,807 INFO L226 Difference]: Without dead ends: 102592 [2019-12-27 15:40:47,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:40:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102592 states. [2019-12-27 15:40:57,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102592 to 102592. [2019-12-27 15:40:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102592 states. [2019-12-27 15:40:58,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102592 states to 102592 states and 434430 transitions. [2019-12-27 15:40:58,246 INFO L78 Accepts]: Start accepts. Automaton has 102592 states and 434430 transitions. Word has length 3 [2019-12-27 15:40:58,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:40:58,247 INFO L462 AbstractCegarLoop]: Abstraction has 102592 states and 434430 transitions. [2019-12-27 15:40:58,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:40:58,247 INFO L276 IsEmpty]: Start isEmpty. Operand 102592 states and 434430 transitions. [2019-12-27 15:40:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 15:40:58,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:40:58,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:40:58,250 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:40:58,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:40:58,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1857942485, now seen corresponding path program 1 times [2019-12-27 15:40:58,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:40:58,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799454212] [2019-12-27 15:40:58,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:40:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:40:58,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:40:58,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799454212] [2019-12-27 15:40:58,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:40:58,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:40:58,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1257656502] [2019-12-27 15:40:58,398 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:40:58,399 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:40:58,404 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 15:40:58,404 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:40:58,404 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:40:58,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:40:58,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:40:58,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:40:58,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:40:58,406 INFO L87 Difference]: Start difference. First operand 102592 states and 434430 transitions. Second operand 4 states. [2019-12-27 15:41:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:03,443 INFO L93 Difference]: Finished difference Result 159508 states and 648686 transitions. [2019-12-27 15:41:03,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:41:03,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 15:41:03,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:04,012 INFO L225 Difference]: With dead ends: 159508 [2019-12-27 15:41:04,012 INFO L226 Difference]: Without dead ends: 159459 [2019-12-27 15:41:04,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:41:08,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159459 states. [2019-12-27 15:41:11,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159459 to 146095. [2019-12-27 15:41:11,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146095 states. [2019-12-27 15:41:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146095 states to 146095 states and 601450 transitions. [2019-12-27 15:41:18,885 INFO L78 Accepts]: Start accepts. Automaton has 146095 states and 601450 transitions. Word has length 11 [2019-12-27 15:41:18,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:18,886 INFO L462 AbstractCegarLoop]: Abstraction has 146095 states and 601450 transitions. [2019-12-27 15:41:18,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:41:18,886 INFO L276 IsEmpty]: Start isEmpty. Operand 146095 states and 601450 transitions. [2019-12-27 15:41:18,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 15:41:18,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:18,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:18,893 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:18,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:18,893 INFO L82 PathProgramCache]: Analyzing trace with hash 230844073, now seen corresponding path program 1 times [2019-12-27 15:41:18,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:18,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403296356] [2019-12-27 15:41:18,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:18,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:41:18,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403296356] [2019-12-27 15:41:18,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:18,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:41:18,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2130032656] [2019-12-27 15:41:18,954 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:18,955 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:18,957 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 15:41:18,957 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:18,957 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:41:18,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:41:18,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:18,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:41:18,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:41:18,958 INFO L87 Difference]: Start difference. First operand 146095 states and 601450 transitions. Second operand 3 states. [2019-12-27 15:41:19,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:19,109 INFO L93 Difference]: Finished difference Result 32284 states and 104220 transitions. [2019-12-27 15:41:19,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:41:19,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 15:41:19,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:19,172 INFO L225 Difference]: With dead ends: 32284 [2019-12-27 15:41:19,172 INFO L226 Difference]: Without dead ends: 32284 [2019-12-27 15:41:19,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:41:19,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32284 states. [2019-12-27 15:41:19,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32284 to 32284. [2019-12-27 15:41:19,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32284 states. [2019-12-27 15:41:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32284 states to 32284 states and 104220 transitions. [2019-12-27 15:41:19,824 INFO L78 Accepts]: Start accepts. Automaton has 32284 states and 104220 transitions. Word has length 13 [2019-12-27 15:41:19,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:19,824 INFO L462 AbstractCegarLoop]: Abstraction has 32284 states and 104220 transitions. [2019-12-27 15:41:19,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:41:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 32284 states and 104220 transitions. [2019-12-27 15:41:19,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 15:41:19,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:19,828 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:19,828 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:19,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:19,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1069845708, now seen corresponding path program 1 times [2019-12-27 15:41:19,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:19,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952783766] [2019-12-27 15:41:19,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:19,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:41:19,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952783766] [2019-12-27 15:41:19,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:19,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:41:19,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1968000446] [2019-12-27 15:41:19,911 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:19,914 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:19,916 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 15:41:19,917 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:19,917 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:41:19,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:41:19,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:19,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:41:19,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:41:19,918 INFO L87 Difference]: Start difference. First operand 32284 states and 104220 transitions. Second operand 4 states. [2019-12-27 15:41:21,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:21,118 INFO L93 Difference]: Finished difference Result 40215 states and 129418 transitions. [2019-12-27 15:41:21,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:41:21,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 15:41:21,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:21,184 INFO L225 Difference]: With dead ends: 40215 [2019-12-27 15:41:21,184 INFO L226 Difference]: Without dead ends: 40215 [2019-12-27 15:41:21,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:41:21,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40215 states. [2019-12-27 15:41:21,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40215 to 36090. [2019-12-27 15:41:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36090 states. [2019-12-27 15:41:21,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36090 states to 36090 states and 116495 transitions. [2019-12-27 15:41:21,826 INFO L78 Accepts]: Start accepts. Automaton has 36090 states and 116495 transitions. Word has length 16 [2019-12-27 15:41:21,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:21,827 INFO L462 AbstractCegarLoop]: Abstraction has 36090 states and 116495 transitions. [2019-12-27 15:41:21,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:41:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 36090 states and 116495 transitions. [2019-12-27 15:41:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 15:41:21,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:21,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:21,837 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:21,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:21,837 INFO L82 PathProgramCache]: Analyzing trace with hash 6986775, now seen corresponding path program 1 times [2019-12-27 15:41:21,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:21,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413217995] [2019-12-27 15:41:21,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:41:21,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413217995] [2019-12-27 15:41:21,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:21,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:41:21,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1920961648] [2019-12-27 15:41:21,975 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:21,979 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:21,986 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 15:41:21,987 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:21,988 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:41:21,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:41:21,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:21,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:41:21,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:41:21,989 INFO L87 Difference]: Start difference. First operand 36090 states and 116495 transitions. Second operand 5 states. [2019-12-27 15:41:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:22,606 INFO L93 Difference]: Finished difference Result 46566 states and 147831 transitions. [2019-12-27 15:41:22,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 15:41:22,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 15:41:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:22,680 INFO L225 Difference]: With dead ends: 46566 [2019-12-27 15:41:22,681 INFO L226 Difference]: Without dead ends: 46559 [2019-12-27 15:41:22,681 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-27 15:41:23,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46559 states. [2019-12-27 15:41:23,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46559 to 35784. [2019-12-27 15:41:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35784 states. [2019-12-27 15:41:23,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35784 states to 35784 states and 115349 transitions. [2019-12-27 15:41:23,819 INFO L78 Accepts]: Start accepts. Automaton has 35784 states and 115349 transitions. Word has length 22 [2019-12-27 15:41:23,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:23,820 INFO L462 AbstractCegarLoop]: Abstraction has 35784 states and 115349 transitions. [2019-12-27 15:41:23,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:41:23,820 INFO L276 IsEmpty]: Start isEmpty. Operand 35784 states and 115349 transitions. [2019-12-27 15:41:23,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 15:41:23,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:23,832 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:23,832 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:23,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:23,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1437372217, now seen corresponding path program 1 times [2019-12-27 15:41:23,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:23,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797879232] [2019-12-27 15:41:23,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:23,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:41:23,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797879232] [2019-12-27 15:41:23,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:23,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 15:41:23,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1309034835] [2019-12-27 15:41:23,892 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:23,895 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:23,905 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 15:41:23,905 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:23,939 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:41:23,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 15:41:23,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:23,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 15:41:23,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:41:23,940 INFO L87 Difference]: Start difference. First operand 35784 states and 115349 transitions. Second operand 5 states. [2019-12-27 15:41:24,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:24,026 INFO L93 Difference]: Finished difference Result 14498 states and 44125 transitions. [2019-12-27 15:41:24,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:41:24,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 15:41:24,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:24,052 INFO L225 Difference]: With dead ends: 14498 [2019-12-27 15:41:24,053 INFO L226 Difference]: Without dead ends: 14498 [2019-12-27 15:41:24,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 15:41:24,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14498 states. [2019-12-27 15:41:24,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14498 to 14254. [2019-12-27 15:41:24,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14254 states. [2019-12-27 15:41:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14254 states to 14254 states and 43429 transitions. [2019-12-27 15:41:24,274 INFO L78 Accepts]: Start accepts. Automaton has 14254 states and 43429 transitions. Word has length 25 [2019-12-27 15:41:24,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:24,275 INFO L462 AbstractCegarLoop]: Abstraction has 14254 states and 43429 transitions. [2019-12-27 15:41:24,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 15:41:24,275 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states and 43429 transitions. [2019-12-27 15:41:24,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 15:41:24,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:24,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:24,288 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:24,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:24,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1947963172, now seen corresponding path program 1 times [2019-12-27 15:41:24,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:24,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581141725] [2019-12-27 15:41:24,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:41:24,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581141725] [2019-12-27 15:41:24,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:24,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:41:24,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2113535831] [2019-12-27 15:41:24,378 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:24,383 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:24,390 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 15:41:24,390 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:24,390 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:41:24,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:41:24,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:24,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:41:24,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:41:24,391 INFO L87 Difference]: Start difference. First operand 14254 states and 43429 transitions. Second operand 6 states. [2019-12-27 15:41:25,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:25,396 INFO L93 Difference]: Finished difference Result 39008 states and 118911 transitions. [2019-12-27 15:41:25,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 15:41:25,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 15:41:25,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:25,452 INFO L225 Difference]: With dead ends: 39008 [2019-12-27 15:41:25,452 INFO L226 Difference]: Without dead ends: 39008 [2019-12-27 15:41:25,452 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-27 15:41:25,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39008 states. [2019-12-27 15:41:25,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39008 to 21620. [2019-12-27 15:41:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21620 states. [2019-12-27 15:41:25,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21620 states to 21620 states and 66985 transitions. [2019-12-27 15:41:25,885 INFO L78 Accepts]: Start accepts. Automaton has 21620 states and 66985 transitions. Word has length 27 [2019-12-27 15:41:25,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:25,886 INFO L462 AbstractCegarLoop]: Abstraction has 21620 states and 66985 transitions. [2019-12-27 15:41:25,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:41:25,886 INFO L276 IsEmpty]: Start isEmpty. Operand 21620 states and 66985 transitions. [2019-12-27 15:41:25,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 15:41:25,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:25,903 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-27 15:41:25,903 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:25,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:25,903 INFO L82 PathProgramCache]: Analyzing trace with hash -89566793, now seen corresponding path program 1 times [2019-12-27 15:41:25,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:25,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994918484] [2019-12-27 15:41:25,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:25,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:41:25,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994918484] [2019-12-27 15:41:25,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:25,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:41:25,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1324513902] [2019-12-27 15:41:25,989 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:25,994 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:26,002 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 15:41:26,003 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:26,003 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:41:26,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 15:41:26,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:26,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 15:41:26,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 15:41:26,004 INFO L87 Difference]: Start difference. First operand 21620 states and 66985 transitions. Second operand 6 states. [2019-12-27 15:41:26,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:26,747 INFO L93 Difference]: Finished difference Result 43584 states and 132186 transitions. [2019-12-27 15:41:26,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 15:41:26,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 15:41:26,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:26,811 INFO L225 Difference]: With dead ends: 43584 [2019-12-27 15:41:26,812 INFO L226 Difference]: Without dead ends: 43584 [2019-12-27 15:41:26,812 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-27 15:41:26,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43584 states. [2019-12-27 15:41:27,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43584 to 21360. [2019-12-27 15:41:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21360 states. [2019-12-27 15:41:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21360 states to 21360 states and 66500 transitions. [2019-12-27 15:41:27,654 INFO L78 Accepts]: Start accepts. Automaton has 21360 states and 66500 transitions. Word has length 28 [2019-12-27 15:41:27,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:27,654 INFO L462 AbstractCegarLoop]: Abstraction has 21360 states and 66500 transitions. [2019-12-27 15:41:27,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 15:41:27,655 INFO L276 IsEmpty]: Start isEmpty. Operand 21360 states and 66500 transitions. [2019-12-27 15:41:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:41:27,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:27,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:27,678 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:27,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:27,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1720610055, now seen corresponding path program 1 times [2019-12-27 15:41:27,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:27,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991355078] [2019-12-27 15:41:27,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:41:27,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991355078] [2019-12-27 15:41:27,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:27,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:41:27,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1474858064] [2019-12-27 15:41:27,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:27,778 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:27,790 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 15:41:27,791 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:27,791 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:41:27,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:41:27,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:27,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:41:27,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:41:27,792 INFO L87 Difference]: Start difference. First operand 21360 states and 66500 transitions. Second operand 7 states. [2019-12-27 15:41:29,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:29,183 INFO L93 Difference]: Finished difference Result 51613 states and 157651 transitions. [2019-12-27 15:41:29,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 15:41:29,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 15:41:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:29,270 INFO L225 Difference]: With dead ends: 51613 [2019-12-27 15:41:29,271 INFO L226 Difference]: Without dead ends: 51613 [2019-12-27 15:41:29,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 15:41:29,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51613 states. [2019-12-27 15:41:29,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51613 to 23540. [2019-12-27 15:41:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23540 states. [2019-12-27 15:41:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23540 states to 23540 states and 73219 transitions. [2019-12-27 15:41:29,823 INFO L78 Accepts]: Start accepts. Automaton has 23540 states and 73219 transitions. Word has length 33 [2019-12-27 15:41:29,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:29,823 INFO L462 AbstractCegarLoop]: Abstraction has 23540 states and 73219 transitions. [2019-12-27 15:41:29,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:41:29,824 INFO L276 IsEmpty]: Start isEmpty. Operand 23540 states and 73219 transitions. [2019-12-27 15:41:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 15:41:29,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:29,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:29,850 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:29,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:29,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1518720007, now seen corresponding path program 2 times [2019-12-27 15:41:29,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:29,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888673900] [2019-12-27 15:41:29,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:41:29,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888673900] [2019-12-27 15:41:29,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:29,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:41:29,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1481822863] [2019-12-27 15:41:29,956 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:29,963 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:29,979 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 73 transitions. [2019-12-27 15:41:29,980 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:29,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:41:30,389 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 15:41:30,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:41:30,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:30,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:41:30,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:41:30,390 INFO L87 Difference]: Start difference. First operand 23540 states and 73219 transitions. Second operand 9 states. [2019-12-27 15:41:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:33,575 INFO L93 Difference]: Finished difference Result 87829 states and 263704 transitions. [2019-12-27 15:41:33,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 15:41:33,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 15:41:33,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:33,709 INFO L225 Difference]: With dead ends: 87829 [2019-12-27 15:41:33,709 INFO L226 Difference]: Without dead ends: 87829 [2019-12-27 15:41:33,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=389, Invalid=1333, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 15:41:33,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87829 states. [2019-12-27 15:41:34,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87829 to 25448. [2019-12-27 15:41:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25448 states. [2019-12-27 15:41:35,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25448 states to 25448 states and 78846 transitions. [2019-12-27 15:41:35,029 INFO L78 Accepts]: Start accepts. Automaton has 25448 states and 78846 transitions. Word has length 33 [2019-12-27 15:41:35,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:35,029 INFO L462 AbstractCegarLoop]: Abstraction has 25448 states and 78846 transitions. [2019-12-27 15:41:35,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:41:35,029 INFO L276 IsEmpty]: Start isEmpty. Operand 25448 states and 78846 transitions. [2019-12-27 15:41:35,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 15:41:35,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:35,055 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-27 15:41:35,056 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:35,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:35,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2146187134, now seen corresponding path program 1 times [2019-12-27 15:41:35,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:35,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907611530] [2019-12-27 15:41:35,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:35,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-27 15:41:35,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907611530] [2019-12-27 15:41:35,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:35,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 15:41:35,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1072318327] [2019-12-27 15:41:35,157 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:35,164 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:35,178 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 62 transitions. [2019-12-27 15:41:35,178 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:35,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:41:35,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:41:35,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:35,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:41:35,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:41:35,180 INFO L87 Difference]: Start difference. First operand 25448 states and 78846 transitions. Second operand 7 states. [2019-12-27 15:41:36,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:36,609 INFO L93 Difference]: Finished difference Result 51173 states and 154813 transitions. [2019-12-27 15:41:36,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 15:41:36,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 15:41:36,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:36,689 INFO L225 Difference]: With dead ends: 51173 [2019-12-27 15:41:36,689 INFO L226 Difference]: Without dead ends: 51173 [2019-12-27 15:41:36,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-27 15:41:36,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51173 states. [2019-12-27 15:41:37,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51173 to 23042. [2019-12-27 15:41:37,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23042 states. [2019-12-27 15:41:37,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23042 states to 23042 states and 71463 transitions. [2019-12-27 15:41:37,216 INFO L78 Accepts]: Start accepts. Automaton has 23042 states and 71463 transitions. Word has length 34 [2019-12-27 15:41:37,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:37,216 INFO L462 AbstractCegarLoop]: Abstraction has 23042 states and 71463 transitions. [2019-12-27 15:41:37,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:41:37,216 INFO L276 IsEmpty]: Start isEmpty. Operand 23042 states and 71463 transitions. [2019-12-27 15:41:37,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 15:41:37,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:37,236 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-27 15:41:37,236 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:37,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:37,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1401085166, now seen corresponding path program 2 times [2019-12-27 15:41:37,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:37,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956213258] [2019-12-27 15:41:37,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:41:37,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956213258] [2019-12-27 15:41:37,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:37,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 15:41:37,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1533700692] [2019-12-27 15:41:37,491 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:37,874 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:37,890 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 56 transitions. [2019-12-27 15:41:37,890 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:37,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 15:41:37,913 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 15:41:37,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:41:37,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:37,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:41:37,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:41:37,914 INFO L87 Difference]: Start difference. First operand 23042 states and 71463 transitions. Second operand 10 states. [2019-12-27 15:41:41,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:41,314 INFO L93 Difference]: Finished difference Result 65982 states and 197944 transitions. [2019-12-27 15:41:41,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 15:41:41,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-12-27 15:41:41,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:41,421 INFO L225 Difference]: With dead ends: 65982 [2019-12-27 15:41:41,421 INFO L226 Difference]: Without dead ends: 65982 [2019-12-27 15:41:41,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=329, Invalid=1231, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 15:41:41,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65982 states. [2019-12-27 15:41:42,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65982 to 22835. [2019-12-27 15:41:42,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22835 states. [2019-12-27 15:41:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22835 states to 22835 states and 70869 transitions. [2019-12-27 15:41:42,059 INFO L78 Accepts]: Start accepts. Automaton has 22835 states and 70869 transitions. Word has length 34 [2019-12-27 15:41:42,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:42,060 INFO L462 AbstractCegarLoop]: Abstraction has 22835 states and 70869 transitions. [2019-12-27 15:41:42,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:41:42,060 INFO L276 IsEmpty]: Start isEmpty. Operand 22835 states and 70869 transitions. [2019-12-27 15:41:42,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 15:41:42,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:42,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:42,405 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:42,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:42,406 INFO L82 PathProgramCache]: Analyzing trace with hash 2037707369, now seen corresponding path program 1 times [2019-12-27 15:41:42,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:42,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850365961] [2019-12-27 15:41:42,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:41:42,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850365961] [2019-12-27 15:41:42,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:42,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 15:41:42,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [397384413] [2019-12-27 15:41:42,472 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:42,480 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:42,541 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 341 transitions. [2019-12-27 15:41:42,541 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:42,542 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:41:42,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:41:42,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:42,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:41:42,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:41:42,543 INFO L87 Difference]: Start difference. First operand 22835 states and 70869 transitions. Second operand 3 states. [2019-12-27 15:41:42,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:42,641 INFO L93 Difference]: Finished difference Result 22834 states and 70867 transitions. [2019-12-27 15:41:42,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:41:42,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 15:41:42,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:42,685 INFO L225 Difference]: With dead ends: 22834 [2019-12-27 15:41:42,685 INFO L226 Difference]: Without dead ends: 22834 [2019-12-27 15:41:42,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:41:42,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22834 states. [2019-12-27 15:41:42,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22834 to 22834. [2019-12-27 15:41:42,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22834 states. [2019-12-27 15:41:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22834 states to 22834 states and 70867 transitions. [2019-12-27 15:41:43,026 INFO L78 Accepts]: Start accepts. Automaton has 22834 states and 70867 transitions. Word has length 39 [2019-12-27 15:41:43,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:43,027 INFO L462 AbstractCegarLoop]: Abstraction has 22834 states and 70867 transitions. [2019-12-27 15:41:43,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:41:43,027 INFO L276 IsEmpty]: Start isEmpty. Operand 22834 states and 70867 transitions. [2019-12-27 15:41:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:41:43,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:43,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:43,058 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:43,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:43,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1505013692, now seen corresponding path program 1 times [2019-12-27 15:41:43,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:43,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357737171] [2019-12-27 15:41:43,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:41:43,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357737171] [2019-12-27 15:41:43,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:43,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:41:43,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1597066228] [2019-12-27 15:41:43,129 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:43,137 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:43,209 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 415 transitions. [2019-12-27 15:41:43,209 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:43,223 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 15:41:43,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 15:41:43,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:43,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 15:41:43,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:41:43,224 INFO L87 Difference]: Start difference. First operand 22834 states and 70867 transitions. Second operand 4 states. [2019-12-27 15:41:43,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:43,490 INFO L93 Difference]: Finished difference Result 44040 states and 137112 transitions. [2019-12-27 15:41:43,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 15:41:43,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 15:41:43,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:43,526 INFO L225 Difference]: With dead ends: 44040 [2019-12-27 15:41:43,526 INFO L226 Difference]: Without dead ends: 24423 [2019-12-27 15:41:43,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 15:41:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24423 states. [2019-12-27 15:41:43,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24423 to 20630. [2019-12-27 15:41:43,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20630 states. [2019-12-27 15:41:43,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20630 states to 20630 states and 62945 transitions. [2019-12-27 15:41:43,856 INFO L78 Accepts]: Start accepts. Automaton has 20630 states and 62945 transitions. Word has length 40 [2019-12-27 15:41:43,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:43,856 INFO L462 AbstractCegarLoop]: Abstraction has 20630 states and 62945 transitions. [2019-12-27 15:41:43,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 15:41:43,856 INFO L276 IsEmpty]: Start isEmpty. Operand 20630 states and 62945 transitions. [2019-12-27 15:41:43,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 15:41:43,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:43,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:43,875 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:43,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:43,876 INFO L82 PathProgramCache]: Analyzing trace with hash 2071452234, now seen corresponding path program 2 times [2019-12-27 15:41:43,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:43,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721162105] [2019-12-27 15:41:43,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:43,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:41:43,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721162105] [2019-12-27 15:41:43,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:43,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 15:41:43,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1725870301] [2019-12-27 15:41:43,934 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:43,942 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:44,024 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 413 transitions. [2019-12-27 15:41:44,024 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:44,060 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 15:41:44,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 15:41:44,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:44,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 15:41:44,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:41:44,061 INFO L87 Difference]: Start difference. First operand 20630 states and 62945 transitions. Second operand 7 states. [2019-12-27 15:41:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:44,471 INFO L93 Difference]: Finished difference Result 19327 states and 59866 transitions. [2019-12-27 15:41:44,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 15:41:44,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 15:41:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:44,498 INFO L225 Difference]: With dead ends: 19327 [2019-12-27 15:41:44,498 INFO L226 Difference]: Without dead ends: 17542 [2019-12-27 15:41:44,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 15:41:44,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17542 states. [2019-12-27 15:41:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17542 to 16604. [2019-12-27 15:41:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16604 states. [2019-12-27 15:41:44,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16604 states to 16604 states and 52882 transitions. [2019-12-27 15:41:44,764 INFO L78 Accepts]: Start accepts. Automaton has 16604 states and 52882 transitions. Word has length 40 [2019-12-27 15:41:44,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:44,764 INFO L462 AbstractCegarLoop]: Abstraction has 16604 states and 52882 transitions. [2019-12-27 15:41:44,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 15:41:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 16604 states and 52882 transitions. [2019-12-27 15:41:44,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:41:44,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:44,781 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:44,781 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:44,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:44,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1765307480, now seen corresponding path program 1 times [2019-12-27 15:41:44,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:44,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020352839] [2019-12-27 15:41:44,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:41:44,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020352839] [2019-12-27 15:41:44,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:44,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:41:44,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1741128085] [2019-12-27 15:41:44,915 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:44,933 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:45,128 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 263 states and 504 transitions. [2019-12-27 15:41:45,129 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:45,259 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 15:41:45,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:41:45,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:45,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:41:45,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:41:45,259 INFO L87 Difference]: Start difference. First operand 16604 states and 52882 transitions. Second operand 12 states. [2019-12-27 15:41:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:50,249 INFO L93 Difference]: Finished difference Result 211488 states and 653239 transitions. [2019-12-27 15:41:50,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-27 15:41:50,250 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 15:41:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:50,501 INFO L225 Difference]: With dead ends: 211488 [2019-12-27 15:41:50,501 INFO L226 Difference]: Without dead ends: 144060 [2019-12-27 15:41:50,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2028 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1176, Invalid=4524, Unknown=0, NotChecked=0, Total=5700 [2019-12-27 15:41:50,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144060 states. [2019-12-27 15:41:52,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144060 to 26306. [2019-12-27 15:41:52,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26306 states. [2019-12-27 15:41:52,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26306 states to 26306 states and 84180 transitions. [2019-12-27 15:41:52,429 INFO L78 Accepts]: Start accepts. Automaton has 26306 states and 84180 transitions. Word has length 64 [2019-12-27 15:41:52,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:52,430 INFO L462 AbstractCegarLoop]: Abstraction has 26306 states and 84180 transitions. [2019-12-27 15:41:52,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:41:52,430 INFO L276 IsEmpty]: Start isEmpty. Operand 26306 states and 84180 transitions. [2019-12-27 15:41:52,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:41:52,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:52,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:52,459 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:52,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:52,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1311278622, now seen corresponding path program 2 times [2019-12-27 15:41:52,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:52,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838717421] [2019-12-27 15:41:52,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:41:52,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838717421] [2019-12-27 15:41:52,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:52,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:41:52,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1373407291] [2019-12-27 15:41:52,536 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:52,558 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:52,766 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 214 states and 383 transitions. [2019-12-27 15:41:52,766 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:52,814 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 15:41:52,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 15:41:52,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:52,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 15:41:52,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 15:41:52,815 INFO L87 Difference]: Start difference. First operand 26306 states and 84180 transitions. Second operand 9 states. [2019-12-27 15:41:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:54,700 INFO L93 Difference]: Finished difference Result 106072 states and 326986 transitions. [2019-12-27 15:41:54,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 15:41:54,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 15:41:54,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:55,345 INFO L225 Difference]: With dead ends: 106072 [2019-12-27 15:41:55,346 INFO L226 Difference]: Without dead ends: 79715 [2019-12-27 15:41:55,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-12-27 15:41:55,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79715 states. [2019-12-27 15:41:56,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79715 to 29850. [2019-12-27 15:41:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29850 states. [2019-12-27 15:41:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29850 states to 29850 states and 95465 transitions. [2019-12-27 15:41:56,177 INFO L78 Accepts]: Start accepts. Automaton has 29850 states and 95465 transitions. Word has length 64 [2019-12-27 15:41:56,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:56,178 INFO L462 AbstractCegarLoop]: Abstraction has 29850 states and 95465 transitions. [2019-12-27 15:41:56,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 15:41:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 29850 states and 95465 transitions. [2019-12-27 15:41:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:41:56,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:56,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:56,212 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:56,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:56,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1457184858, now seen corresponding path program 3 times [2019-12-27 15:41:56,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:56,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764753553] [2019-12-27 15:41:56,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:41:56,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764753553] [2019-12-27 15:41:56,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:56,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 15:41:56,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1263878112] [2019-12-27 15:41:56,300 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:56,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:41:56,542 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 333 transitions. [2019-12-27 15:41:56,542 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:41:56,732 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 15:41:56,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 15:41:56,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:41:56,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 15:41:56,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-27 15:41:56,734 INFO L87 Difference]: Start difference. First operand 29850 states and 95465 transitions. Second operand 12 states. [2019-12-27 15:41:58,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:41:58,866 INFO L93 Difference]: Finished difference Result 77982 states and 242677 transitions. [2019-12-27 15:41:58,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 15:41:58,866 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 15:41:58,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:41:58,974 INFO L225 Difference]: With dead ends: 77982 [2019-12-27 15:41:58,974 INFO L226 Difference]: Without dead ends: 68156 [2019-12-27 15:41:58,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-27 15:41:59,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68156 states. [2019-12-27 15:41:59,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68156 to 30154. [2019-12-27 15:41:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30154 states. [2019-12-27 15:41:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30154 states to 30154 states and 96379 transitions. [2019-12-27 15:41:59,737 INFO L78 Accepts]: Start accepts. Automaton has 30154 states and 96379 transitions. Word has length 64 [2019-12-27 15:41:59,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:41:59,737 INFO L462 AbstractCegarLoop]: Abstraction has 30154 states and 96379 transitions. [2019-12-27 15:41:59,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 15:41:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand 30154 states and 96379 transitions. [2019-12-27 15:41:59,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 15:41:59,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:41:59,775 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:41:59,776 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:41:59,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:41:59,776 INFO L82 PathProgramCache]: Analyzing trace with hash -144189884, now seen corresponding path program 4 times [2019-12-27 15:41:59,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:41:59,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917789722] [2019-12-27 15:41:59,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:41:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:41:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:41:59,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917789722] [2019-12-27 15:41:59,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:41:59,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:41:59,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1615321675] [2019-12-27 15:41:59,854 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:41:59,877 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:00,094 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 199 states and 355 transitions. [2019-12-27 15:42:00,094 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:00,095 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:42:00,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:42:00,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:00,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:42:00,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:42:00,097 INFO L87 Difference]: Start difference. First operand 30154 states and 96379 transitions. Second operand 3 states. [2019-12-27 15:42:00,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:00,201 INFO L93 Difference]: Finished difference Result 21333 states and 67697 transitions. [2019-12-27 15:42:00,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:42:00,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 15:42:00,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:00,240 INFO L225 Difference]: With dead ends: 21333 [2019-12-27 15:42:00,240 INFO L226 Difference]: Without dead ends: 21333 [2019-12-27 15:42:00,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:42:00,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21333 states. [2019-12-27 15:42:00,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21333 to 19780. [2019-12-27 15:42:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19780 states. [2019-12-27 15:42:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19780 states to 19780 states and 62550 transitions. [2019-12-27 15:42:01,031 INFO L78 Accepts]: Start accepts. Automaton has 19780 states and 62550 transitions. Word has length 64 [2019-12-27 15:42:01,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:01,031 INFO L462 AbstractCegarLoop]: Abstraction has 19780 states and 62550 transitions. [2019-12-27 15:42:01,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:42:01,031 INFO L276 IsEmpty]: Start isEmpty. Operand 19780 states and 62550 transitions. [2019-12-27 15:42:01,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 15:42:01,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:01,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:01,055 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:42:01,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:01,055 INFO L82 PathProgramCache]: Analyzing trace with hash -646853691, now seen corresponding path program 1 times [2019-12-27 15:42:01,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:01,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792416894] [2019-12-27 15:42:01,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:01,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:42:01,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792416894] [2019-12-27 15:42:01,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:01,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:42:01,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2047941759] [2019-12-27 15:42:01,134 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:01,153 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:01,430 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 366 transitions. [2019-12-27 15:42:01,431 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:01,435 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 15:42:01,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:42:01,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:01,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:42:01,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:42:01,436 INFO L87 Difference]: Start difference. First operand 19780 states and 62550 transitions. Second operand 3 states. [2019-12-27 15:42:01,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:01,659 INFO L93 Difference]: Finished difference Result 24221 states and 75700 transitions. [2019-12-27 15:42:01,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:42:01,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 15:42:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:01,720 INFO L225 Difference]: With dead ends: 24221 [2019-12-27 15:42:01,721 INFO L226 Difference]: Without dead ends: 24221 [2019-12-27 15:42:01,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:42:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24221 states. [2019-12-27 15:42:02,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24221 to 21225. [2019-12-27 15:42:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21225 states. [2019-12-27 15:42:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21225 states to 21225 states and 67022 transitions. [2019-12-27 15:42:02,322 INFO L78 Accepts]: Start accepts. Automaton has 21225 states and 67022 transitions. Word has length 65 [2019-12-27 15:42:02,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:02,322 INFO L462 AbstractCegarLoop]: Abstraction has 21225 states and 67022 transitions. [2019-12-27 15:42:02,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:42:02,322 INFO L276 IsEmpty]: Start isEmpty. Operand 21225 states and 67022 transitions. [2019-12-27 15:42:02,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:42:02,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:02,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:02,359 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:42:02,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:02,359 INFO L82 PathProgramCache]: Analyzing trace with hash 882937623, now seen corresponding path program 1 times [2019-12-27 15:42:02,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:02,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900980302] [2019-12-27 15:42:02,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:42:02,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900980302] [2019-12-27 15:42:02,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:02,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 15:42:02,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [33859480] [2019-12-27 15:42:02,500 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:02,530 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:02,763 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 308 transitions. [2019-12-27 15:42:02,764 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:02,870 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 15:42:02,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 15:42:02,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:02,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 15:42:02,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 15:42:02,871 INFO L87 Difference]: Start difference. First operand 21225 states and 67022 transitions. Second operand 10 states. [2019-12-27 15:42:04,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:04,959 INFO L93 Difference]: Finished difference Result 99974 states and 306144 transitions. [2019-12-27 15:42:04,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 15:42:04,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 15:42:04,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:05,079 INFO L225 Difference]: With dead ends: 99974 [2019-12-27 15:42:05,079 INFO L226 Difference]: Without dead ends: 81961 [2019-12-27 15:42:05,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=308, Invalid=814, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 15:42:05,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81961 states. [2019-12-27 15:42:05,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81961 to 22936. [2019-12-27 15:42:05,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22936 states. [2019-12-27 15:42:05,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22936 states to 22936 states and 72469 transitions. [2019-12-27 15:42:05,882 INFO L78 Accepts]: Start accepts. Automaton has 22936 states and 72469 transitions. Word has length 66 [2019-12-27 15:42:05,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:05,882 INFO L462 AbstractCegarLoop]: Abstraction has 22936 states and 72469 transitions. [2019-12-27 15:42:05,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 15:42:05,882 INFO L276 IsEmpty]: Start isEmpty. Operand 22936 states and 72469 transitions. [2019-12-27 15:42:05,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 15:42:05,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:05,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, 1] [2019-12-27 15:42:05,909 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:42:05,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:05,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1442275055, now seen corresponding path program 1 times [2019-12-27 15:42:05,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:05,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093016941] [2019-12-27 15:42:05,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 15:42:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 15:42:05,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093016941] [2019-12-27 15:42:05,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 15:42:05,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 15:42:05,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [995094045] [2019-12-27 15:42:05,967 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 15:42:05,987 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 15:42:06,179 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 385 transitions. [2019-12-27 15:42:06,180 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 15:42:06,181 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 15:42:06,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 15:42:06,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 15:42:06,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 15:42:06,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:42:06,181 INFO L87 Difference]: Start difference. First operand 22936 states and 72469 transitions. Second operand 3 states. [2019-12-27 15:42:06,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 15:42:06,260 INFO L93 Difference]: Finished difference Result 22936 states and 72468 transitions. [2019-12-27 15:42:06,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 15:42:06,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 15:42:06,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 15:42:06,295 INFO L225 Difference]: With dead ends: 22936 [2019-12-27 15:42:06,295 INFO L226 Difference]: Without dead ends: 22936 [2019-12-27 15:42:06,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 15:42:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22936 states. [2019-12-27 15:42:06,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22936 to 17402. [2019-12-27 15:42:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17402 states. [2019-12-27 15:42:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17402 states to 17402 states and 55406 transitions. [2019-12-27 15:42:06,854 INFO L78 Accepts]: Start accepts. Automaton has 17402 states and 55406 transitions. Word has length 66 [2019-12-27 15:42:06,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 15:42:06,855 INFO L462 AbstractCegarLoop]: Abstraction has 17402 states and 55406 transitions. [2019-12-27 15:42:06,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 15:42:06,855 INFO L276 IsEmpty]: Start isEmpty. Operand 17402 states and 55406 transitions. [2019-12-27 15:42:06,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 15:42:06,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 15:42:06,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 15:42:06,875 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 15:42:06,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 15:42:06,875 INFO L82 PathProgramCache]: Analyzing trace with hash 763340387, now seen corresponding path program 1 times [2019-12-27 15:42:06,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 15:42:06,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347990812] [2019-12-27 15:42:06,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 15:42:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:42:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 15:42:07,059 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 15:42:07,060 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 15:42:07,064 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_ULTIMATE.start_main_~#t159~0.offset_17| 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t159~0.base_27| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t159~0.base_27|) |v_ULTIMATE.start_main_~#t159~0.offset_17| 0)) |v_#memory_int_19|) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t159~0.base_27| 1)) (= v_~weak$$choice2~0_147 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t159~0.base_27|) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd1~0_158 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t159~0.base_27|)) (= 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) (= 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_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t159~0.base_27| 4)) (= 0 v_~x~0_154) (= v_~z$r_buff0_thd2~0_129 0) (= 0 v_~__unbuffered_cnt~0_88) (= v_~z~0_181 0) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= 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{ULTIMATE.start_main_~#t161~0.offset=|v_ULTIMATE.start_main_~#t161~0.offset_17|, ~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, ~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, ULTIMATE.start_main_~#t159~0.base=|v_ULTIMATE.start_main_~#t159~0.base_27|, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ULTIMATE.start_main_~#t160~0.base=|v_ULTIMATE.start_main_~#t160~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~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, ULTIMATE.start_main_~#t161~0.base=|v_ULTIMATE.start_main_~#t161~0.base_23|, ~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_~#t160~0.offset=|v_ULTIMATE.start_main_~#t160~0.offset_16|, 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, ~__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|, ULTIMATE.start_main_~#t159~0.offset=|v_ULTIMATE.start_main_~#t159~0.offset_17|, ~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[ULTIMATE.start_main_~#t161~0.offset, ~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, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t159~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_~#t160~0.base, ~weak$$choice0~0, ~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, ULTIMATE.start_main_~#t161~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t160~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__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, ULTIMATE.start_main_~#t159~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:42:07,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L830-1-->L832: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t160~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t160~0.base_11|) |v_ULTIMATE.start_main_~#t160~0.offset_9| 1)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t160~0.base_11| 0)) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t160~0.base_11| 1) |v_#valid_35|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t160~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t160~0.offset_9|) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t160~0.base_11|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t160~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t160~0.base=|v_ULTIMATE.start_main_~#t160~0.base_11|, ULTIMATE.start_main_~#t160~0.offset=|v_ULTIMATE.start_main_~#t160~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, 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_~#t160~0.base, ULTIMATE.start_main_~#t160~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 15:42:07,067 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-27 15:42:07,069 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-509898013 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-509898013 256)))) (or (and (= ~z$w_buff1~0_In-509898013 |P1Thread1of1ForFork2_#t~ite9_Out-509898013|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In-509898013 |P1Thread1of1ForFork2_#t~ite9_Out-509898013|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-509898013, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-509898013, ~z$w_buff1~0=~z$w_buff1~0_In-509898013, ~z~0=~z~0_In-509898013} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-509898013|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-509898013, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-509898013, ~z$w_buff1~0=~z$w_buff1~0_In-509898013, ~z~0=~z~0_In-509898013} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 15:42:07,069 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-27 15:42:07,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-1007787147 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1007787147 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1007787147 |P1Thread1of1ForFork2_#t~ite11_Out-1007787147|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1007787147|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1007787147, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1007787147} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1007787147, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1007787147|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1007787147} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 15:42:07,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd2~0_In-2010194211 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-2010194211 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-2010194211 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-2010194211 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-2010194211|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-2010194211| ~z$w_buff1_used~0_In-2010194211) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2010194211, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2010194211, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2010194211, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2010194211} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2010194211, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2010194211, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2010194211, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-2010194211|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2010194211} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 15:42:07,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L832-1-->L834: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t161~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t161~0.base_9|) |v_ULTIMATE.start_main_~#t161~0.offset_8| 2))) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t161~0.base_9|) 0) (not (= |v_ULTIMATE.start_main_~#t161~0.base_9| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t161~0.base_9|) (= |v_ULTIMATE.start_main_~#t161~0.offset_8| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t161~0.base_9| 1) |v_#valid_27|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t161~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|, ULTIMATE.start_main_~#t161~0.offset=|v_ULTIMATE.start_main_~#t161~0.offset_8|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t161~0.base=|v_ULTIMATE.start_main_~#t161~0.base_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t161~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t161~0.base, #length] because there is no mapped edge [2019-12-27 15:42:07,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-753679617 256)))) (or (and (= ~z$w_buff0~0_In-753679617 |P2Thread1of1ForFork0_#t~ite21_Out-753679617|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In-753679617| |P2Thread1of1ForFork0_#t~ite20_Out-753679617|)) (and (= |P2Thread1of1ForFork0_#t~ite20_Out-753679617| ~z$w_buff0~0_In-753679617) (= |P2Thread1of1ForFork0_#t~ite20_Out-753679617| |P2Thread1of1ForFork0_#t~ite21_Out-753679617|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-753679617 256)))) (or (and (= (mod ~z$r_buff1_thd3~0_In-753679617 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In-753679617 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In-753679617 256)) .cse1))) .cse0))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-753679617, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-753679617, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-753679617, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-753679617, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-753679617, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-753679617|, ~weak$$choice2~0=~weak$$choice2~0_In-753679617} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-753679617|, ~z$w_buff0~0=~z$w_buff0~0_In-753679617, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-753679617, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-753679617, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-753679617, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-753679617, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-753679617|, ~weak$$choice2~0=~weak$$choice2~0_In-753679617} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 15:42:07,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1836521524 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1836521524 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out1836521524| 0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In1836521524 |P1Thread1of1ForFork2_#t~ite13_Out1836521524|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1836521524, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1836521524} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1836521524, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1836521524|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1836521524} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 15:42:07,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L775-->L775-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In65800289 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In65800289 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In65800289 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In65800289 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out65800289|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$r_buff1_thd2~0_In65800289 |P1Thread1of1ForFork2_#t~ite14_Out65800289|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In65800289, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In65800289, ~z$w_buff1_used~0=~z$w_buff1_used~0_In65800289, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In65800289} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In65800289, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In65800289, ~z$w_buff1_used~0=~z$w_buff1_used~0_In65800289, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out65800289|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In65800289} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 15:42:07,078 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-27 15:42:07,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In863777432 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite24_Out863777432| |P2Thread1of1ForFork0_#t~ite23_Out863777432|) (= |P2Thread1of1ForFork0_#t~ite23_Out863777432| ~z$w_buff1~0_In863777432) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In863777432 256)))) (or (and (= (mod ~z$w_buff1_used~0_In863777432 256) 0) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In863777432 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In863777432 256) 0)))) (and (= |P2Thread1of1ForFork0_#t~ite24_Out863777432| ~z$w_buff1~0_In863777432) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In863777432| |P2Thread1of1ForFork0_#t~ite23_Out863777432|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In863777432, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In863777432, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In863777432|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In863777432, ~z$w_buff1~0=~z$w_buff1~0_In863777432, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In863777432, ~weak$$choice2~0=~weak$$choice2~0_In863777432} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In863777432, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out863777432|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In863777432, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out863777432|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In863777432, ~z$w_buff1~0=~z$w_buff1~0_In863777432, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In863777432, ~weak$$choice2~0=~weak$$choice2~0_In863777432} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 15:42:07,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L798-->L798-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1825622599 256)))) (or (and (= ~z$w_buff0_used~0_In1825622599 |P2Thread1of1ForFork0_#t~ite26_Out1825622599|) (= |P2Thread1of1ForFork0_#t~ite27_Out1825622599| |P2Thread1of1ForFork0_#t~ite26_Out1825622599|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1825622599 256)))) (or (and (= (mod ~z$w_buff1_used~0_In1825622599 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In1825622599 256) 0) (and (= (mod ~z$r_buff1_thd3~0_In1825622599 256) 0) .cse0))) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite27_Out1825622599| ~z$w_buff0_used~0_In1825622599) (= |P2Thread1of1ForFork0_#t~ite26_In1825622599| |P2Thread1of1ForFork0_#t~ite26_Out1825622599|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1825622599|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1825622599, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1825622599, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1825622599, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1825622599, ~weak$$choice2~0=~weak$$choice2~0_In1825622599} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1825622599|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1825622599|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1825622599, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1825622599, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1825622599, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1825622599, ~weak$$choice2~0=~weak$$choice2~0_In1825622599} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 15:42:07,083 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-27 15:42:07,086 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-27 15:42:07,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In682868186 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In682868186 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In682868186 |P0Thread1of1ForFork1_#t~ite5_Out682868186|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out682868186|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In682868186, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In682868186} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out682868186|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In682868186, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In682868186} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 15:42:07,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1591139964 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1591139964 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1591139964| ~z$w_buff1~0_In1591139964)) (and (= ~z~0_In1591139964 |P2Thread1of1ForFork0_#t~ite38_Out1591139964|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1591139964, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1591139964, ~z$w_buff1~0=~z$w_buff1~0_In1591139964, ~z~0=~z~0_In1591139964} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1591139964|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1591139964, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1591139964, ~z$w_buff1~0=~z$w_buff1~0_In1591139964, ~z~0=~z~0_In1591139964} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 15:42:07,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L750-->L750-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In1876587805 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1876587805 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1876587805 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In1876587805 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1876587805 |P0Thread1of1ForFork1_#t~ite6_Out1876587805|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1876587805|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1876587805, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1876587805, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1876587805, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1876587805} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1876587805, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1876587805|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1876587805, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1876587805, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1876587805} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 15:42:07,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L751-->L752: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1008022685 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1008022685 256)))) (or (and (= ~z$r_buff0_thd1~0_Out-1008022685 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In-1008022685 ~z$r_buff0_thd1~0_Out-1008022685) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1008022685, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1008022685} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1008022685, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1008022685|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1008022685} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 15:42:07,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1073968189 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In1073968189 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1073968189 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1073968189 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out1073968189| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite8_Out1073968189| ~z$r_buff1_thd1~0_In1073968189)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1073968189, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1073968189, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1073968189, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1073968189} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1073968189|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1073968189, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1073968189, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1073968189, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1073968189} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 15:42:07,090 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-27 15:42:07,090 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-27 15:42:07,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In591008942 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In591008942 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out591008942| ~z$w_buff0_used~0_In591008942) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out591008942|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In591008942, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In591008942} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In591008942, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out591008942|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In591008942} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 15:42:07,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In34610876 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In34610876 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In34610876 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In34610876 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out34610876|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In34610876 |P2Thread1of1ForFork0_#t~ite41_Out34610876|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In34610876, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In34610876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In34610876, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In34610876} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In34610876, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In34610876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In34610876, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In34610876, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out34610876|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 15:42:07,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1981881564 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1981881564 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out1981881564| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out1981881564| ~z$r_buff0_thd3~0_In1981881564) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1981881564, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1981881564} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1981881564, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1981881564, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1981881564|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 15:42:07,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-871659153 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-871659153 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-871659153 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-871659153 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-871659153 |P2Thread1of1ForFork0_#t~ite43_Out-871659153|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-871659153|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-871659153, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-871659153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-871659153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-871659153} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-871659153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-871659153, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-871659153, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-871659153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-871659153} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 15:42:07,094 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-27 15:42:07,094 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-27 15:42:07,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L840-2-->L840-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite48_Out-1562020074| |ULTIMATE.start_main_#t~ite47_Out-1562020074|)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1562020074 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1562020074 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= |ULTIMATE.start_main_#t~ite47_Out-1562020074| ~z$w_buff1~0_In-1562020074)) (and .cse1 (= |ULTIMATE.start_main_#t~ite47_Out-1562020074| ~z~0_In-1562020074) (or .cse0 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1562020074, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1562020074, ~z$w_buff1~0=~z$w_buff1~0_In-1562020074, ~z~0=~z~0_In-1562020074} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1562020074, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1562020074|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1562020074, ~z$w_buff1~0=~z$w_buff1~0_In-1562020074, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1562020074|, ~z~0=~z~0_In-1562020074} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 15:42:07,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1852909329 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1852909329 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-1852909329| 0)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1852909329 |ULTIMATE.start_main_#t~ite49_Out-1852909329|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1852909329, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852909329} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1852909329, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852909329, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1852909329|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 15:42:07,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L842-->L842-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In101658677 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In101658677 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In101658677 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In101658677 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out101658677|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite50_Out101658677| ~z$w_buff1_used~0_In101658677) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In101658677, ~z$w_buff0_used~0=~z$w_buff0_used~0_In101658677, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In101658677, ~z$w_buff1_used~0=~z$w_buff1_used~0_In101658677} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out101658677|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In101658677, ~z$w_buff0_used~0=~z$w_buff0_used~0_In101658677, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In101658677, ~z$w_buff1_used~0=~z$w_buff1_used~0_In101658677} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 15:42:07,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-154880217 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-154880217 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-154880217| ~z$r_buff0_thd0~0_In-154880217)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-154880217| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-154880217, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-154880217} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-154880217, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-154880217|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-154880217} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 15:42:07,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-62675433 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-62675433 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-62675433 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-62675433 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-62675433 |ULTIMATE.start_main_#t~ite52_Out-62675433|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-62675433|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-62675433, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-62675433, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-62675433, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-62675433} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-62675433|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-62675433, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-62675433, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-62675433, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-62675433} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 15:42:07,100 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-27 15:42:07,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:42:07 BasicIcfg [2019-12-27 15:42:07,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 15:42:07,205 INFO L168 Benchmark]: Toolchain (without parser) took 110785.43 ms. Allocated memory was 146.3 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 102.2 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 15:42:07,206 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 15:42:07,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.62 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 154.8 MB in the end (delta: -53.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 15:42:07,207 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.61 ms. Allocated memory is still 203.4 MB. Free memory was 154.8 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:42:07,208 INFO L168 Benchmark]: Boogie Preprocessor took 60.59 ms. Allocated memory is still 203.4 MB. Free memory was 152.2 MB in the beginning and 149.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 15:42:07,208 INFO L168 Benchmark]: RCFGBuilder took 951.32 ms. Allocated memory is still 203.4 MB. Free memory was 149.5 MB in the beginning and 98.8 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-27 15:42:07,209 INFO L168 Benchmark]: TraceAbstraction took 108921.77 ms. Allocated memory was 203.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 98.8 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 15:42:07,211 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.15 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 773.62 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 154.8 MB in the end (delta: -53.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.61 ms. Allocated memory is still 203.4 MB. Free memory was 154.8 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.59 ms. Allocated memory is still 203.4 MB. Free memory was 152.2 MB in the beginning and 149.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 951.32 ms. Allocated memory is still 203.4 MB. Free memory was 149.5 MB in the beginning and 98.8 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108921.77 ms. Allocated memory was 203.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 98.8 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.6 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(&t159, ((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(&t160, ((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(&t161, ((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: 108.5s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 38.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5203 SDtfs, 9445 SDslu, 17300 SDs, 0 SdLazy, 12118 SolverSat, 663 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 436 GetRequests, 97 SyntacticMatches, 27 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3559 ImplicationChecksByTransitivity, 5.7s 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: 39.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 509312 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 918 NumberOfCodeBlocks, 918 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 132066 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...