/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/rfi008_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:50:07,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:50:07,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:50:07,253 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:50:07,254 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:50:07,256 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:50:07,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:50:07,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:50:07,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:50:07,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:50:07,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:50:07,280 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:50:07,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:50:07,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:50:07,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:50:07,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:50:07,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:50:07,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:50:07,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:50:07,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:50:07,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:50:07,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:50:07,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:50:07,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:50:07,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:50:07,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:50:07,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:50:07,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:50:07,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:50:07,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:50:07,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:50:07,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:50:07,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:50:07,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:50:07,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:50:07,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:50:07,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:50:07,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:50:07,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:50:07,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:50:07,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:50:07,320 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 17:50:07,347 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:50:07,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:50:07,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:50:07,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:50:07,349 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:50:07,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:50:07,350 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:50:07,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:50:07,350 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:50:07,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:50:07,351 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:50:07,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:50:07,352 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:50:07,352 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:50:07,352 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:50:07,353 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:50:07,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:50:07,353 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:50:07,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:50:07,353 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:50:07,354 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:50:07,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:50:07,354 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:50:07,354 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:50:07,354 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:50:07,355 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:50:07,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:50:07,355 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:50:07,355 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:50:07,355 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:50:07,356 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:50:07,691 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:50:07,711 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:50:07,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:50:07,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:50:07,717 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:50:07,718 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008_pso.oepc.i [2019-12-27 17:50:07,792 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d07f729fc/e482132223f64c0c9225765fe6f608ce/FLAG74357ec64 [2019-12-27 17:50:08,374 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:50:08,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008_pso.oepc.i [2019-12-27 17:50:08,396 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d07f729fc/e482132223f64c0c9225765fe6f608ce/FLAG74357ec64 [2019-12-27 17:50:08,610 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d07f729fc/e482132223f64c0c9225765fe6f608ce [2019-12-27 17:50:08,619 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:50:08,621 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:50:08,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:50:08,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:50:08,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:50:08,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:50:08" (1/1) ... [2019-12-27 17:50:08,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7462832b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:08, skipping insertion in model container [2019-12-27 17:50:08,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:50:08" (1/1) ... [2019-12-27 17:50:08,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:50:08,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:50:09,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:50:09,259 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:50:09,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:50:09,399 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:50:09,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:09 WrapperNode [2019-12-27 17:50:09,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:50:09,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:50:09,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:50:09,400 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:50:09,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:09" (1/1) ... [2019-12-27 17:50:09,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:09" (1/1) ... [2019-12-27 17:50:09,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:50:09,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:50:09,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:50:09,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:50:09,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:09" (1/1) ... [2019-12-27 17:50:09,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:09" (1/1) ... [2019-12-27 17:50:09,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:09" (1/1) ... [2019-12-27 17:50:09,481 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:09" (1/1) ... [2019-12-27 17:50:09,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:09" (1/1) ... [2019-12-27 17:50:09,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:09" (1/1) ... [2019-12-27 17:50:09,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:09" (1/1) ... [2019-12-27 17:50:09,507 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:50:09,508 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:50:09,508 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:50:09,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:50:09,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:09" (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 17:50:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:50:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:50:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:50:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:50:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:50:09,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:50:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:50:09,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:50:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:50:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:50:09,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:50:09,578 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 17:50:10,405 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:50:10,406 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:50:10,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:50:10 BoogieIcfgContainer [2019-12-27 17:50:10,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:50:10,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:50:10,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:50:10,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:50:10,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:50:08" (1/3) ... [2019-12-27 17:50:10,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a56e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:50:10, skipping insertion in model container [2019-12-27 17:50:10,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:50:09" (2/3) ... [2019-12-27 17:50:10,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a56e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:50:10, skipping insertion in model container [2019-12-27 17:50:10,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:50:10" (3/3) ... [2019-12-27 17:50:10,416 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_pso.oepc.i [2019-12-27 17:50:10,426 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:50:10,427 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:50:10,434 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:50:10,435 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:50:10,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,502 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,502 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,502 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,503 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,504 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,508 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,509 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,520 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,521 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,524 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,530 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,531 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,550 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,561 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,564 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,568 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,569 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,572 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:50:10,588 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:50:10,607 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:50:10,607 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:50:10,608 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:50:10,608 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:50:10,608 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:50:10,608 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:50:10,608 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:50:10,608 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:50:10,624 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-27 17:50:10,626 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-27 17:50:10,754 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-27 17:50:10,754 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:50:10,779 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 625 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 17:50:10,810 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-27 17:50:10,901 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-27 17:50:10,901 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:50:10,914 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 625 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 17:50:10,948 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-27 17:50:10,950 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:50:16,811 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 17:50:16,954 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146813 [2019-12-27 17:50:16,955 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 17:50:16,958 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 136 transitions [2019-12-27 17:50:18,710 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 29658 states. [2019-12-27 17:50:18,712 INFO L276 IsEmpty]: Start isEmpty. Operand 29658 states. [2019-12-27 17:50:18,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:50:18,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:18,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:50:18,718 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:18,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:18,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1084682, now seen corresponding path program 1 times [2019-12-27 17:50:18,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:18,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70574639] [2019-12-27 17:50:18,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:50:18,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70574639] [2019-12-27 17:50:18,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:18,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:50:18,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2122470203] [2019-12-27 17:50:18,945 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:18,949 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:18,961 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:50:18,961 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:18,965 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:50:18,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:50:18,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:18,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:50:18,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:50:18,982 INFO L87 Difference]: Start difference. First operand 29658 states. Second operand 3 states. [2019-12-27 17:50:19,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:19,643 INFO L93 Difference]: Finished difference Result 29506 states and 103746 transitions. [2019-12-27 17:50:19,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:50:19,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:50:19,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:19,906 INFO L225 Difference]: With dead ends: 29506 [2019-12-27 17:50:19,906 INFO L226 Difference]: Without dead ends: 27490 [2019-12-27 17:50:19,908 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 17:50:21,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27490 states. [2019-12-27 17:50:22,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27490 to 27490. [2019-12-27 17:50:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27490 states. [2019-12-27 17:50:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27490 states to 27490 states and 96576 transitions. [2019-12-27 17:50:22,261 INFO L78 Accepts]: Start accepts. Automaton has 27490 states and 96576 transitions. Word has length 3 [2019-12-27 17:50:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:22,262 INFO L462 AbstractCegarLoop]: Abstraction has 27490 states and 96576 transitions. [2019-12-27 17:50:22,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:50:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 27490 states and 96576 transitions. [2019-12-27 17:50:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:50:22,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:22,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:22,270 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:22,271 INFO L82 PathProgramCache]: Analyzing trace with hash -272589760, now seen corresponding path program 1 times [2019-12-27 17:50:22,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:22,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434672011] [2019-12-27 17:50:22,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:22,382 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 17:50:22,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434672011] [2019-12-27 17:50:22,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:22,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:50:22,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1573025175] [2019-12-27 17:50:22,383 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:22,386 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:22,390 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:50:22,390 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:22,390 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:50:22,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:50:22,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:22,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:50:22,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:50:22,393 INFO L87 Difference]: Start difference. First operand 27490 states and 96576 transitions. Second operand 3 states. [2019-12-27 17:50:22,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:22,474 INFO L93 Difference]: Finished difference Result 3269 states and 8037 transitions. [2019-12-27 17:50:22,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:50:22,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 17:50:22,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:22,484 INFO L225 Difference]: With dead ends: 3269 [2019-12-27 17:50:22,485 INFO L226 Difference]: Without dead ends: 3269 [2019-12-27 17:50:22,486 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 17:50:22,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2019-12-27 17:50:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3269. [2019-12-27 17:50:22,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3269 states. [2019-12-27 17:50:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 8037 transitions. [2019-12-27 17:50:22,584 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 8037 transitions. Word has length 11 [2019-12-27 17:50:22,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:22,585 INFO L462 AbstractCegarLoop]: Abstraction has 3269 states and 8037 transitions. [2019-12-27 17:50:22,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:50:22,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 8037 transitions. [2019-12-27 17:50:22,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:50:22,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:22,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:22,592 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:22,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:22,592 INFO L82 PathProgramCache]: Analyzing trace with hash 295368792, now seen corresponding path program 1 times [2019-12-27 17:50:22,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:22,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093626208] [2019-12-27 17:50:22,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:22,687 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 17:50:22,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093626208] [2019-12-27 17:50:22,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:22,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:50:22,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [26839644] [2019-12-27 17:50:22,689 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:22,690 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:22,693 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 17:50:22,693 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:22,693 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:50:22,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:50:22,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:22,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:50:22,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:50:22,694 INFO L87 Difference]: Start difference. First operand 3269 states and 8037 transitions. Second operand 4 states. [2019-12-27 17:50:23,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:23,018 INFO L93 Difference]: Finished difference Result 4313 states and 10392 transitions. [2019-12-27 17:50:23,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:50:23,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 17:50:23,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:23,030 INFO L225 Difference]: With dead ends: 4313 [2019-12-27 17:50:23,030 INFO L226 Difference]: Without dead ends: 4313 [2019-12-27 17:50:23,031 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 17:50:23,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2019-12-27 17:50:23,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4245. [2019-12-27 17:50:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4245 states. [2019-12-27 17:50:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4245 states to 4245 states and 10260 transitions. [2019-12-27 17:50:23,148 INFO L78 Accepts]: Start accepts. Automaton has 4245 states and 10260 transitions. Word has length 14 [2019-12-27 17:50:23,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:23,148 INFO L462 AbstractCegarLoop]: Abstraction has 4245 states and 10260 transitions. [2019-12-27 17:50:23,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:50:23,149 INFO L276 IsEmpty]: Start isEmpty. Operand 4245 states and 10260 transitions. [2019-12-27 17:50:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 17:50:23,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:23,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:23,152 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:23,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:23,152 INFO L82 PathProgramCache]: Analyzing trace with hash 566526596, now seen corresponding path program 1 times [2019-12-27 17:50:23,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:23,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680666720] [2019-12-27 17:50:23,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:23,220 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 17:50:23,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680666720] [2019-12-27 17:50:23,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:23,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:50:23,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [764643725] [2019-12-27 17:50:23,221 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:23,226 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:23,228 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 17:50:23,228 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:23,228 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:50:23,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:50:23,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:23,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:50:23,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:50:23,230 INFO L87 Difference]: Start difference. First operand 4245 states and 10260 transitions. Second operand 3 states. [2019-12-27 17:50:23,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:23,395 INFO L93 Difference]: Finished difference Result 7552 states and 17381 transitions. [2019-12-27 17:50:23,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:50:23,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 17:50:23,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:23,415 INFO L225 Difference]: With dead ends: 7552 [2019-12-27 17:50:23,416 INFO L226 Difference]: Without dead ends: 7552 [2019-12-27 17:50:23,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:50:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7552 states. [2019-12-27 17:50:23,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7552 to 6526. [2019-12-27 17:50:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6526 states. [2019-12-27 17:50:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6526 states to 6526 states and 15257 transitions. [2019-12-27 17:50:23,572 INFO L78 Accepts]: Start accepts. Automaton has 6526 states and 15257 transitions. Word has length 15 [2019-12-27 17:50:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:23,573 INFO L462 AbstractCegarLoop]: Abstraction has 6526 states and 15257 transitions. [2019-12-27 17:50:23,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:50:23,573 INFO L276 IsEmpty]: Start isEmpty. Operand 6526 states and 15257 transitions. [2019-12-27 17:50:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:50:23,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:23,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:50:23,575 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:23,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:23,575 INFO L82 PathProgramCache]: Analyzing trace with hash -759251224, now seen corresponding path program 1 times [2019-12-27 17:50:23,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:23,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584923618] [2019-12-27 17:50:23,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:23,657 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 17:50:23,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584923618] [2019-12-27 17:50:23,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:23,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:50:23,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1053420687] [2019-12-27 17:50:23,658 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:23,660 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:23,662 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 18 states and 17 transitions. [2019-12-27 17:50:23,663 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:23,663 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:50:23,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:50:23,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:23,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:50:23,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:50:23,664 INFO L87 Difference]: Start difference. First operand 6526 states and 15257 transitions. Second operand 4 states. [2019-12-27 17:50:23,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:23,948 INFO L93 Difference]: Finished difference Result 7957 states and 18351 transitions. [2019-12-27 17:50:23,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:50:23,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 17:50:23,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:23,974 INFO L225 Difference]: With dead ends: 7957 [2019-12-27 17:50:23,974 INFO L226 Difference]: Without dead ends: 7957 [2019-12-27 17:50:23,975 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 17:50:23,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7957 states. [2019-12-27 17:50:24,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7957 to 6579. [2019-12-27 17:50:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6579 states. [2019-12-27 17:50:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6579 states to 6579 states and 15368 transitions. [2019-12-27 17:50:24,115 INFO L78 Accepts]: Start accepts. Automaton has 6579 states and 15368 transitions. Word has length 17 [2019-12-27 17:50:24,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:24,116 INFO L462 AbstractCegarLoop]: Abstraction has 6579 states and 15368 transitions. [2019-12-27 17:50:24,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:50:24,116 INFO L276 IsEmpty]: Start isEmpty. Operand 6579 states and 15368 transitions. [2019-12-27 17:50:24,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:50:24,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:24,121 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 17:50:24,121 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:24,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:24,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1258171186, now seen corresponding path program 1 times [2019-12-27 17:50:24,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:24,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423265497] [2019-12-27 17:50:24,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:24,191 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 17:50:24,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423265497] [2019-12-27 17:50:24,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:24,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:50:24,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [644468036] [2019-12-27 17:50:24,193 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:24,198 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:24,203 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:50:24,203 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:24,204 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:50:24,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:50:24,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:24,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:50:24,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:50:24,205 INFO L87 Difference]: Start difference. First operand 6579 states and 15368 transitions. Second operand 5 states. [2019-12-27 17:50:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:24,615 INFO L93 Difference]: Finished difference Result 8876 states and 20253 transitions. [2019-12-27 17:50:24,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:50:24,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 17:50:24,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:24,650 INFO L225 Difference]: With dead ends: 8876 [2019-12-27 17:50:24,650 INFO L226 Difference]: Without dead ends: 8876 [2019-12-27 17:50:24,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:50:24,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8876 states. [2019-12-27 17:50:24,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8876 to 8439. [2019-12-27 17:50:24,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8439 states. [2019-12-27 17:50:24,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8439 states to 8439 states and 19387 transitions. [2019-12-27 17:50:24,832 INFO L78 Accepts]: Start accepts. Automaton has 8439 states and 19387 transitions. Word has length 27 [2019-12-27 17:50:24,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:24,833 INFO L462 AbstractCegarLoop]: Abstraction has 8439 states and 19387 transitions. [2019-12-27 17:50:24,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:50:24,833 INFO L276 IsEmpty]: Start isEmpty. Operand 8439 states and 19387 transitions. [2019-12-27 17:50:24,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 17:50:24,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:24,840 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] [2019-12-27 17:50:24,841 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:24,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:24,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1366134434, now seen corresponding path program 1 times [2019-12-27 17:50:24,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:24,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560973102] [2019-12-27 17:50:24,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:24,876 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 17:50:24,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560973102] [2019-12-27 17:50:24,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:24,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:50:24,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1200183413] [2019-12-27 17:50:24,878 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:24,884 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:24,968 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 30 transitions. [2019-12-27 17:50:24,969 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:24,969 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:50:24,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:50:24,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:24,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:50:24,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:50:24,971 INFO L87 Difference]: Start difference. First operand 8439 states and 19387 transitions. Second operand 3 states. [2019-12-27 17:50:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:25,061 INFO L93 Difference]: Finished difference Result 9584 states and 20860 transitions. [2019-12-27 17:50:25,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:50:25,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 17:50:25,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:25,074 INFO L225 Difference]: With dead ends: 9584 [2019-12-27 17:50:25,075 INFO L226 Difference]: Without dead ends: 9584 [2019-12-27 17:50:25,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:50:25,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9584 states. [2019-12-27 17:50:25,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9584 to 8440. [2019-12-27 17:50:25,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8440 states. [2019-12-27 17:50:25,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8440 states to 8440 states and 18504 transitions. [2019-12-27 17:50:25,235 INFO L78 Accepts]: Start accepts. Automaton has 8440 states and 18504 transitions. Word has length 30 [2019-12-27 17:50:25,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:25,236 INFO L462 AbstractCegarLoop]: Abstraction has 8440 states and 18504 transitions. [2019-12-27 17:50:25,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:50:25,236 INFO L276 IsEmpty]: Start isEmpty. Operand 8440 states and 18504 transitions. [2019-12-27 17:50:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:50:25,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:25,249 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 17:50:25,250 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:25,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:25,250 INFO L82 PathProgramCache]: Analyzing trace with hash -736726388, now seen corresponding path program 1 times [2019-12-27 17:50:25,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:25,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11503214] [2019-12-27 17:50:25,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:25,346 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 17:50:25,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11503214] [2019-12-27 17:50:25,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:25,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:50:25,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [970009970] [2019-12-27 17:50:25,348 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:25,357 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:25,370 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 33 transitions. [2019-12-27 17:50:25,370 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:25,371 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:50:25,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:50:25,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:25,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:50:25,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:50:25,372 INFO L87 Difference]: Start difference. First operand 8440 states and 18504 transitions. Second operand 5 states. [2019-12-27 17:50:25,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:25,889 INFO L93 Difference]: Finished difference Result 9537 states and 20673 transitions. [2019-12-27 17:50:25,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:50:25,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 17:50:25,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:25,900 INFO L225 Difference]: With dead ends: 9537 [2019-12-27 17:50:25,901 INFO L226 Difference]: Without dead ends: 9537 [2019-12-27 17:50:25,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:50:25,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9537 states. [2019-12-27 17:50:26,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9537 to 7558. [2019-12-27 17:50:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7558 states. [2019-12-27 17:50:26,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7558 states to 7558 states and 16717 transitions. [2019-12-27 17:50:26,048 INFO L78 Accepts]: Start accepts. Automaton has 7558 states and 16717 transitions. Word has length 33 [2019-12-27 17:50:26,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:26,051 INFO L462 AbstractCegarLoop]: Abstraction has 7558 states and 16717 transitions. [2019-12-27 17:50:26,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:50:26,052 INFO L276 IsEmpty]: Start isEmpty. Operand 7558 states and 16717 transitions. [2019-12-27 17:50:26,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 17:50:26,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:26,072 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 17:50:26,073 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:26,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:26,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1616999435, now seen corresponding path program 1 times [2019-12-27 17:50:26,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:26,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105935964] [2019-12-27 17:50:26,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:26,149 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 17:50:26,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105935964] [2019-12-27 17:50:26,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:26,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:50:26,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [769216564] [2019-12-27 17:50:26,151 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:26,159 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:26,174 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 39 transitions. [2019-12-27 17:50:26,174 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:26,174 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:50:26,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:50:26,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:26,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:50:26,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:50:26,175 INFO L87 Difference]: Start difference. First operand 7558 states and 16717 transitions. Second operand 4 states. [2019-12-27 17:50:26,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:26,203 INFO L93 Difference]: Finished difference Result 5263 states and 11555 transitions. [2019-12-27 17:50:26,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:50:26,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 17:50:26,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:26,211 INFO L225 Difference]: With dead ends: 5263 [2019-12-27 17:50:26,211 INFO L226 Difference]: Without dead ends: 5263 [2019-12-27 17:50:26,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:50:26,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2019-12-27 17:50:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5159. [2019-12-27 17:50:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5159 states. [2019-12-27 17:50:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5159 states to 5159 states and 11362 transitions. [2019-12-27 17:50:26,299 INFO L78 Accepts]: Start accepts. Automaton has 5159 states and 11362 transitions. Word has length 39 [2019-12-27 17:50:26,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:26,300 INFO L462 AbstractCegarLoop]: Abstraction has 5159 states and 11362 transitions. [2019-12-27 17:50:26,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:50:26,300 INFO L276 IsEmpty]: Start isEmpty. Operand 5159 states and 11362 transitions. [2019-12-27 17:50:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 17:50:26,312 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:26,312 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, 1] [2019-12-27 17:50:26,312 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:26,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:26,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1602567421, now seen corresponding path program 1 times [2019-12-27 17:50:26,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:26,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649253490] [2019-12-27 17:50:26,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:26,575 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 17:50:26,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649253490] [2019-12-27 17:50:26,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:26,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:50:26,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1132086782] [2019-12-27 17:50:26,577 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:26,599 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:26,727 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 264 transitions. [2019-12-27 17:50:26,727 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:26,924 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 17:50:26,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:50:26,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:26,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:50:26,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:50:26,925 INFO L87 Difference]: Start difference. First operand 5159 states and 11362 transitions. Second operand 12 states. [2019-12-27 17:50:27,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:27,590 INFO L93 Difference]: Finished difference Result 9824 states and 21398 transitions. [2019-12-27 17:50:27,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 17:50:27,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-27 17:50:27,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:27,604 INFO L225 Difference]: With dead ends: 9824 [2019-12-27 17:50:27,604 INFO L226 Difference]: Without dead ends: 8719 [2019-12-27 17:50:27,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2019-12-27 17:50:27,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8719 states. [2019-12-27 17:50:27,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8719 to 6443. [2019-12-27 17:50:27,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6443 states. [2019-12-27 17:50:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6443 states to 6443 states and 14388 transitions. [2019-12-27 17:50:27,767 INFO L78 Accepts]: Start accepts. Automaton has 6443 states and 14388 transitions. Word has length 68 [2019-12-27 17:50:27,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:27,768 INFO L462 AbstractCegarLoop]: Abstraction has 6443 states and 14388 transitions. [2019-12-27 17:50:27,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:50:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 6443 states and 14388 transitions. [2019-12-27 17:50:27,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 17:50:27,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:27,787 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, 1] [2019-12-27 17:50:27,787 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:27,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:27,787 INFO L82 PathProgramCache]: Analyzing trace with hash -544831189, now seen corresponding path program 2 times [2019-12-27 17:50:27,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:27,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426171555] [2019-12-27 17:50:27,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:27,937 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 17:50:27,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426171555] [2019-12-27 17:50:27,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:27,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:50:27,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1464327603] [2019-12-27 17:50:27,939 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:27,954 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:28,188 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 299 transitions. [2019-12-27 17:50:28,188 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:28,225 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:50:28,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:50:28,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:28,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:50:28,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:50:28,226 INFO L87 Difference]: Start difference. First operand 6443 states and 14388 transitions. Second operand 7 states. [2019-12-27 17:50:28,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:28,432 INFO L93 Difference]: Finished difference Result 9381 states and 20893 transitions. [2019-12-27 17:50:28,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:50:28,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-27 17:50:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:28,446 INFO L225 Difference]: With dead ends: 9381 [2019-12-27 17:50:28,446 INFO L226 Difference]: Without dead ends: 7879 [2019-12-27 17:50:28,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:50:28,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7879 states. [2019-12-27 17:50:28,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7879 to 7779. [2019-12-27 17:50:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7779 states. [2019-12-27 17:50:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7779 states to 7779 states and 17459 transitions. [2019-12-27 17:50:28,588 INFO L78 Accepts]: Start accepts. Automaton has 7779 states and 17459 transitions. Word has length 68 [2019-12-27 17:50:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:28,588 INFO L462 AbstractCegarLoop]: Abstraction has 7779 states and 17459 transitions. [2019-12-27 17:50:28,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:50:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 7779 states and 17459 transitions. [2019-12-27 17:50:28,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 17:50:28,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:28,605 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, 1] [2019-12-27 17:50:28,605 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:28,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:28,605 INFO L82 PathProgramCache]: Analyzing trace with hash 402951891, now seen corresponding path program 3 times [2019-12-27 17:50:28,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:28,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559861435] [2019-12-27 17:50:28,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:28,715 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 17:50:28,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559861435] [2019-12-27 17:50:28,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:28,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:50:28,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1947942614] [2019-12-27 17:50:28,716 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:28,738 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:29,205 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 344 transitions. [2019-12-27 17:50:29,205 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:29,259 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:50:29,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:50:29,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:29,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:50:29,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:50:29,260 INFO L87 Difference]: Start difference. First operand 7779 states and 17459 transitions. Second operand 10 states. [2019-12-27 17:50:29,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:29,768 INFO L93 Difference]: Finished difference Result 11922 states and 26443 transitions. [2019-12-27 17:50:29,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 17:50:29,768 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2019-12-27 17:50:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:29,782 INFO L225 Difference]: With dead ends: 11922 [2019-12-27 17:50:29,783 INFO L226 Difference]: Without dead ends: 11455 [2019-12-27 17:50:29,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:50:29,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11455 states. [2019-12-27 17:50:29,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11455 to 7833. [2019-12-27 17:50:29,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7833 states. [2019-12-27 17:50:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7833 states to 7833 states and 17576 transitions. [2019-12-27 17:50:29,926 INFO L78 Accepts]: Start accepts. Automaton has 7833 states and 17576 transitions. Word has length 68 [2019-12-27 17:50:29,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:29,927 INFO L462 AbstractCegarLoop]: Abstraction has 7833 states and 17576 transitions. [2019-12-27 17:50:29,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:50:29,927 INFO L276 IsEmpty]: Start isEmpty. Operand 7833 states and 17576 transitions. [2019-12-27 17:50:29,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 17:50:29,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:29,942 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, 1] [2019-12-27 17:50:29,942 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:29,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:29,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1969468459, now seen corresponding path program 4 times [2019-12-27 17:50:29,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:29,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655361319] [2019-12-27 17:50:29,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:30,006 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 17:50:30,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655361319] [2019-12-27 17:50:30,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:30,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:50:30,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [121034340] [2019-12-27 17:50:30,007 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:30,029 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:30,154 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 264 transitions. [2019-12-27 17:50:30,154 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:30,163 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:50:30,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:50:30,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:30,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:50:30,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:50:30,164 INFO L87 Difference]: Start difference. First operand 7833 states and 17576 transitions. Second operand 5 states. [2019-12-27 17:50:30,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:30,299 INFO L93 Difference]: Finished difference Result 8882 states and 19761 transitions. [2019-12-27 17:50:30,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:50:30,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-27 17:50:30,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:30,301 INFO L225 Difference]: With dead ends: 8882 [2019-12-27 17:50:30,301 INFO L226 Difference]: Without dead ends: 1067 [2019-12-27 17:50:30,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:50:30,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2019-12-27 17:50:30,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 890. [2019-12-27 17:50:30,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-12-27 17:50:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1849 transitions. [2019-12-27 17:50:30,312 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1849 transitions. Word has length 68 [2019-12-27 17:50:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:30,313 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1849 transitions. [2019-12-27 17:50:30,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:50:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1849 transitions. [2019-12-27 17:50:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 17:50:30,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:30,315 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, 1, 1] [2019-12-27 17:50:30,315 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:30,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:30,316 INFO L82 PathProgramCache]: Analyzing trace with hash 26038562, now seen corresponding path program 1 times [2019-12-27 17:50:30,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:30,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241482426] [2019-12-27 17:50:30,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:30,419 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 17:50:30,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241482426] [2019-12-27 17:50:30,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:30,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:50:30,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [170017936] [2019-12-27 17:50:30,420 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:30,440 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:30,679 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 304 transitions. [2019-12-27 17:50:30,679 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:30,728 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:50:30,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:50:30,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:30,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:50:30,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:50:30,730 INFO L87 Difference]: Start difference. First operand 890 states and 1849 transitions. Second operand 5 states. [2019-12-27 17:50:30,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:30,988 INFO L93 Difference]: Finished difference Result 1006 states and 2057 transitions. [2019-12-27 17:50:30,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:50:30,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-27 17:50:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:30,990 INFO L225 Difference]: With dead ends: 1006 [2019-12-27 17:50:30,990 INFO L226 Difference]: Without dead ends: 1006 [2019-12-27 17:50:30,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:50:30,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-12-27 17:50:31,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 968. [2019-12-27 17:50:31,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2019-12-27 17:50:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1990 transitions. [2019-12-27 17:50:31,006 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1990 transitions. Word has length 69 [2019-12-27 17:50:31,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:31,006 INFO L462 AbstractCegarLoop]: Abstraction has 968 states and 1990 transitions. [2019-12-27 17:50:31,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:50:31,007 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1990 transitions. [2019-12-27 17:50:31,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 17:50:31,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:31,009 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, 1, 1] [2019-12-27 17:50:31,009 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:31,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:31,009 INFO L82 PathProgramCache]: Analyzing trace with hash 673963970, now seen corresponding path program 2 times [2019-12-27 17:50:31,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:31,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895336237] [2019-12-27 17:50:31,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:31,145 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 17:50:31,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895336237] [2019-12-27 17:50:31,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:31,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:50:31,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [833164576] [2019-12-27 17:50:31,147 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:31,166 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:31,275 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 227 transitions. [2019-12-27 17:50:31,275 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:31,276 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:50:31,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:50:31,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:31,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:50:31,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:50:31,277 INFO L87 Difference]: Start difference. First operand 968 states and 1990 transitions. Second operand 3 states. [2019-12-27 17:50:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:31,290 INFO L93 Difference]: Finished difference Result 968 states and 1989 transitions. [2019-12-27 17:50:31,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:50:31,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-27 17:50:31,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:31,292 INFO L225 Difference]: With dead ends: 968 [2019-12-27 17:50:31,292 INFO L226 Difference]: Without dead ends: 968 [2019-12-27 17:50:31,293 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 17:50:31,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-12-27 17:50:31,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 899. [2019-12-27 17:50:31,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-12-27 17:50:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1867 transitions. [2019-12-27 17:50:31,304 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1867 transitions. Word has length 69 [2019-12-27 17:50:31,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:31,305 INFO L462 AbstractCegarLoop]: Abstraction has 899 states and 1867 transitions. [2019-12-27 17:50:31,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:50:31,305 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1867 transitions. [2019-12-27 17:50:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 17:50:31,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:31,306 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, 1, 1, 1] [2019-12-27 17:50:31,307 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:31,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:31,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1220286072, now seen corresponding path program 1 times [2019-12-27 17:50:31,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:31,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934177690] [2019-12-27 17:50:31,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:31,579 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 17:50:31,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934177690] [2019-12-27 17:50:31,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:31,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:50:31,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1930262227] [2019-12-27 17:50:31,581 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:31,952 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:32,117 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 195 states and 305 transitions. [2019-12-27 17:50:32,117 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:32,402 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 39 times. [2019-12-27 17:50:32,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 17:50:32,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:32,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 17:50:32,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:50:32,403 INFO L87 Difference]: Start difference. First operand 899 states and 1867 transitions. Second operand 18 states. [2019-12-27 17:50:34,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:34,618 INFO L93 Difference]: Finished difference Result 2202 states and 4346 transitions. [2019-12-27 17:50:34,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 17:50:34,618 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2019-12-27 17:50:34,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:34,622 INFO L225 Difference]: With dead ends: 2202 [2019-12-27 17:50:34,622 INFO L226 Difference]: Without dead ends: 2178 [2019-12-27 17:50:34,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=182, Invalid=748, Unknown=0, NotChecked=0, Total=930 [2019-12-27 17:50:34,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2019-12-27 17:50:34,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 1170. [2019-12-27 17:50:34,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170 states. [2019-12-27 17:50:34,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 2355 transitions. [2019-12-27 17:50:34,636 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 2355 transitions. Word has length 70 [2019-12-27 17:50:34,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:34,636 INFO L462 AbstractCegarLoop]: Abstraction has 1170 states and 2355 transitions. [2019-12-27 17:50:34,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 17:50:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 2355 transitions. [2019-12-27 17:50:34,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 17:50:34,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:34,637 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, 1, 1, 1] [2019-12-27 17:50:34,638 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:34,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:34,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1670334514, now seen corresponding path program 2 times [2019-12-27 17:50:34,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:34,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272429767] [2019-12-27 17:50:34,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:50:34,750 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 17:50:34,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272429767] [2019-12-27 17:50:34,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:50:34,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:50:34,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1590371807] [2019-12-27 17:50:34,752 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:50:34,776 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:50:34,965 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 228 transitions. [2019-12-27 17:50:34,965 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:50:34,967 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:50:34,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:50:34,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:50:34,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:50:34,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:50:34,968 INFO L87 Difference]: Start difference. First operand 1170 states and 2355 transitions. Second operand 5 states. [2019-12-27 17:50:35,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:50:35,041 INFO L93 Difference]: Finished difference Result 1309 states and 2627 transitions. [2019-12-27 17:50:35,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:50:35,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-27 17:50:35,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:50:35,043 INFO L225 Difference]: With dead ends: 1309 [2019-12-27 17:50:35,043 INFO L226 Difference]: Without dead ends: 1309 [2019-12-27 17:50:35,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:50:35,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2019-12-27 17:50:35,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1118. [2019-12-27 17:50:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2019-12-27 17:50:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 2257 transitions. [2019-12-27 17:50:35,057 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 2257 transitions. Word has length 70 [2019-12-27 17:50:35,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:50:35,058 INFO L462 AbstractCegarLoop]: Abstraction has 1118 states and 2257 transitions. [2019-12-27 17:50:35,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:50:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 2257 transitions. [2019-12-27 17:50:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 17:50:35,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:50:35,059 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, 1, 1, 1, 1] [2019-12-27 17:50:35,059 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:50:35,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:50:35,060 INFO L82 PathProgramCache]: Analyzing trace with hash 477046829, now seen corresponding path program 1 times [2019-12-27 17:50:35,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:50:35,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032539305] [2019-12-27 17:50:35,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:50:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:50:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:50:35,242 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:50:35,242 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:50:35,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~main$tmp_guard0~0_19 0) (= v_~main$tmp_guard1~0_73 0) (= 0 v_~x~0_344) (= 0 v_~x$w_buff0_used~0_997) (= (store .cse0 |v_ULTIMATE.start_main_~#t1725~0.base_51| 1) |v_#valid_72|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1725~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1725~0.base_51|) |v_ULTIMATE.start_main_~#t1725~0.offset_32| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p0_EAX~0_106) (= 0 v_~x$w_buff1~0_221) (= v_~y~0_54 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1725~0.base_51|)) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 |v_ULTIMATE.start_main_~#t1725~0.offset_32|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1725~0.base_51| 4)) (= v_~x$r_buff0_thd0~0_190 0) (= 0 v_~x$w_buff0~0_234) (= 0 v_~x$mem_tmp~0_169) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_599 0) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_106 0) (= v_~x$r_buff1_thd0~0_225 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1725~0.base_51|) (= 0 v_~x$w_buff1_used~0_499) (= |v_#NULL.offset_5| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd2~0_403) (= v_~x$r_buff1_thd1~0_379 0) (= v_~x$flush_delayed~0_191 0) (= v_~weak$$choice2~0_254 0) (= 0 v_~__unbuffered_cnt~0_72) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= 0 v_~x$r_buff1_thd2~0_320))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_234, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_599, ULTIMATE.start_main_~#t1726~0.base=|v_ULTIMATE.start_main_~#t1726~0.base_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_191, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_147|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_379, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_73, ~x$mem_tmp~0=v_~x$mem_tmp~0_169, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ULTIMATE.start_main_~#t1725~0.offset=|v_ULTIMATE.start_main_~#t1725~0.offset_32|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, #length=|v_#length_17|, ~y~0=v_~y~0_54, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_190, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ULTIMATE.start_main_~#t1726~0.offset=|v_ULTIMATE.start_main_~#t1726~0.offset_18|, ~x$w_buff1~0=v_~x$w_buff1~0_221, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_320, ULTIMATE.start_main_~#t1725~0.base=|v_ULTIMATE.start_main_~#t1725~0.base_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_225, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_403, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_997, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~x~0=v_~x~0_344, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1726~0.base, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_~#t1725~0.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1726~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1725~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet61, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 17:50:35,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1726~0.base_11| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1726~0.offset_10| 0) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1726~0.base_11|) 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1726~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1726~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1726~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1726~0.base_11|) |v_ULTIMATE.start_main_~#t1726~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t1726~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1726~0.base=|v_ULTIMATE.start_main_~#t1726~0.base_11|, ULTIMATE.start_main_~#t1726~0.offset=|v_ULTIMATE.start_main_~#t1726~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1726~0.base, ULTIMATE.start_main_~#t1726~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-27 17:50:35,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1216197142)) (= ~weak$$choice2~0_Out-1216197142 ~x$flush_delayed~0_Out-1216197142) (= ~x$r_buff0_thd1~0_In-1216197142 ~x$r_buff1_thd1~0_Out-1216197142) (= ~x$r_buff0_thd0~0_In-1216197142 ~x$r_buff1_thd0~0_Out-1216197142) (= ~x$mem_tmp~0_Out-1216197142 ~x~0_In-1216197142) (= |P0Thread1of1ForFork1_#t~nondet4_In-1216197142| ~weak$$choice2~0_Out-1216197142) (= |P0Thread1of1ForFork1_#t~nondet3_In-1216197142| ~weak$$choice0~0_Out-1216197142) (= ~x$r_buff1_thd2~0_Out-1216197142 ~x$r_buff0_thd2~0_In-1216197142) (= ~x$r_buff0_thd1~0_Out-1216197142 1)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1216197142, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1216197142, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1216197142, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In-1216197142|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1216197142, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In-1216197142|, ~x~0=~x~0_In-1216197142} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1216197142, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1216197142, ~x$flush_delayed~0=~x$flush_delayed~0_Out-1216197142, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-1216197142, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-1216197142, ~x$mem_tmp~0=~x$mem_tmp~0_Out-1216197142, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1216197142, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1216197142, ~weak$$choice0~0=~weak$$choice0~0_Out-1216197142, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1216197142, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out-1216197142|, ~weak$$choice2~0=~weak$$choice2~0_Out-1216197142, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out-1216197142|, ~x~0=~x~0_In-1216197142} AuxVars[] AssignedVars[~weak$$choice0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~nondet3, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] because there is no mapped edge [2019-12-27 17:50:35,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L744-2-->L744-5: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-378875648 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-378875648 256) 0)) (.cse0 (= |P0Thread1of1ForFork1_#t~ite5_Out-378875648| |P0Thread1of1ForFork1_#t~ite6_Out-378875648|))) (or (and .cse0 (= |P0Thread1of1ForFork1_#t~ite5_Out-378875648| ~x$w_buff1~0_In-378875648) (or .cse1 .cse2)) (and (not .cse1) (not .cse2) .cse0 (= |P0Thread1of1ForFork1_#t~ite5_Out-378875648| ~x$w_buff0~0_In-378875648)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-378875648, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-378875648, ~x$w_buff1~0=~x$w_buff1~0_In-378875648, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-378875648} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-378875648, P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-378875648|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-378875648, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-378875648|, ~x$w_buff1~0=~x$w_buff1~0_In-378875648, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-378875648} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 17:50:35,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~x$r_buff0_thd1~0_87 v_~x$r_buff0_thd1~0_86)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_11|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_86, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 17:50:35,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In370961596 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite25_Out370961596| ~x$mem_tmp~0_In370961596) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork1_#t~ite25_Out370961596| ~x~0_In370961596)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In370961596, ~x$mem_tmp~0=~x$mem_tmp~0_In370961596, ~x~0=~x~0_In370961596} OutVars{P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out370961596|, ~x$flush_delayed~0=~x$flush_delayed~0_In370961596, ~x$mem_tmp~0=~x$mem_tmp~0_In370961596, ~x~0=~x~0_In370961596} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 17:50:35,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-2053917538 256) 0))) (or (and (= ~x~0_In-2053917538 |P1Thread1of1ForFork0_#t~ite54_Out-2053917538|) .cse0) (and (= ~x$mem_tmp~0_In-2053917538 |P1Thread1of1ForFork0_#t~ite54_Out-2053917538|) (not .cse0)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-2053917538, ~x$mem_tmp~0=~x$mem_tmp~0_In-2053917538, ~x~0=~x~0_In-2053917538} OutVars{P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-2053917538|, ~x$flush_delayed~0=~x$flush_delayed~0_In-2053917538, ~x$mem_tmp~0=~x$mem_tmp~0_In-2053917538, ~x~0=~x~0_In-2053917538} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 17:50:35,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In1133928721 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1133928721 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite55_Out1133928721| ~x~0_In1133928721)) (and (= |P1Thread1of1ForFork0_#t~ite55_Out1133928721| ~x$w_buff1~0_In1133928721) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1133928721, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1133928721, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1133928721, ~x~0=~x~0_In1133928721} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1133928721, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1133928721, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1133928721, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out1133928721|, ~x~0=~x~0_In1133928721} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-27 17:50:35,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~x~0_77 |v_P1Thread1of1ForFork0_#t~ite55_10|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_10|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_13|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_9|, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~x~0] because there is no mapped edge [2019-12-27 17:50:35,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1500137103 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1500137103 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite57_Out-1500137103|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1500137103 |P1Thread1of1ForFork0_#t~ite57_Out-1500137103|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1500137103, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1500137103} OutVars{P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out-1500137103|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1500137103, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1500137103} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-27 17:50:35,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In317712955 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In317712955 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In317712955 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In317712955 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite58_Out317712955| ~x$w_buff1_used~0_In317712955)) (and (= 0 |P1Thread1of1ForFork0_#t~ite58_Out317712955|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In317712955, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In317712955, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In317712955, ~x$w_buff0_used~0=~x$w_buff0_used~0_In317712955} OutVars{P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out317712955|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In317712955, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In317712955, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In317712955, ~x$w_buff0_used~0=~x$w_buff0_used~0_In317712955} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-27 17:50:35,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1106357327 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1106357327 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite59_Out-1106357327| ~x$r_buff0_thd2~0_In-1106357327)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite59_Out-1106357327|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1106357327, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1106357327} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1106357327, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out-1106357327|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1106357327} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-27 17:50:35,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L799-->L799-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-414357800 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-414357800 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-414357800 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-414357800 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite60_Out-414357800| ~x$r_buff1_thd2~0_In-414357800) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite60_Out-414357800| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-414357800, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-414357800, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-414357800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-414357800} OutVars{P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-414357800|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-414357800, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-414357800, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-414357800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-414357800} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-27 17:50:35,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_36|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_192, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 17:50:35,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1435889689 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1435889689 256)))) (or (and (= ~x$w_buff0_used~0_In1435889689 |P0Thread1of1ForFork1_#t~ite28_Out1435889689|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite28_Out1435889689|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1435889689, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1435889689} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1435889689, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out1435889689|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1435889689} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 17:50:35,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L761-->L761-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In2029698422 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2029698422 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In2029698422 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In2029698422 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite29_Out2029698422|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In2029698422 |P0Thread1of1ForFork1_#t~ite29_Out2029698422|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2029698422, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2029698422, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2029698422, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2029698422} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2029698422, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out2029698422|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2029698422, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2029698422, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2029698422} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 17:50:35,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L762-->L763: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-835315783 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-835315783 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd1~0_Out-835315783)) (and (= ~x$r_buff0_thd1~0_Out-835315783 ~x$r_buff0_thd1~0_In-835315783) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-835315783, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-835315783} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-835315783, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out-835315783|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-835315783} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 17:50:35,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L763-->L763-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In2035177829 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In2035177829 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In2035177829 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2035177829 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd1~0_In2035177829 |P0Thread1of1ForFork1_#t~ite31_Out2035177829|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork1_#t~ite31_Out2035177829|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2035177829, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2035177829, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2035177829, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2035177829} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2035177829, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2035177829, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2035177829, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out2035177829|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2035177829} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 17:50:35,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_36|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_36|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_35|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 17:50:35,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 2 v_~__unbuffered_cnt~0_18)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 17:50:35,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L826-2-->L826-5: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1482718162 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1482718162 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite64_Out-1482718162| |ULTIMATE.start_main_#t~ite63_Out-1482718162|))) (or (and (= ~x$w_buff1~0_In-1482718162 |ULTIMATE.start_main_#t~ite63_Out-1482718162|) (not .cse0) (not .cse1) .cse2) (and (= ~x~0_In-1482718162 |ULTIMATE.start_main_#t~ite63_Out-1482718162|) (or .cse1 .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1482718162, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1482718162, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1482718162, ~x~0=~x~0_In-1482718162} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1482718162|, ~x$w_buff1~0=~x$w_buff1~0_In-1482718162, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1482718162, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1482718162, ~x~0=~x~0_In-1482718162, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1482718162|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-27 17:50:35,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-733559763 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-733559763 256)))) (or (and (= ~x$w_buff0_used~0_In-733559763 |ULTIMATE.start_main_#t~ite65_Out-733559763|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite65_Out-733559763|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-733559763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-733559763} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-733559763, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-733559763|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-733559763} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-27 17:50:35,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L828-->L828-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-2125158191 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-2125158191 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2125158191 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-2125158191 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite66_Out-2125158191|)) (and (= |ULTIMATE.start_main_#t~ite66_Out-2125158191| ~x$w_buff1_used~0_In-2125158191) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2125158191, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2125158191, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2125158191, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2125158191} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2125158191, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2125158191, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-2125158191|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2125158191, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2125158191} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-27 17:50:35,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1476890403 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1476890403 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite67_Out1476890403|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In1476890403 |ULTIMATE.start_main_#t~ite67_Out1476890403|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1476890403, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1476890403} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1476890403, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out1476890403|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1476890403} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-27 17:50:35,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1012] [1012] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1794108949 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1794108949 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In1794108949 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1794108949 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite68_Out1794108949| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite68_Out1794108949| ~x$r_buff1_thd0~0_In1794108949) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1794108949, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1794108949, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1794108949, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1794108949} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1794108949, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1794108949, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1794108949|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1794108949, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1794108949} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-27 17:50:35,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~x$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_83|) (= 1 v_~__unbuffered_p1_EAX~0_73) (= v_~__unbuffered_p0_EBX~0_47 0) (= v_~__unbuffered_p1_EBX~0_62 0) (= v_~main$tmp_guard1~0_40 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_83|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:50:35,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:50:35 BasicIcfg [2019-12-27 17:50:35,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:50:35,438 INFO L168 Benchmark]: Toolchain (without parser) took 26817.13 ms. Allocated memory was 145.2 MB in the beginning and 1.0 GB in the end (delta: 899.7 MB). Free memory was 101.8 MB in the beginning and 741.4 MB in the end (delta: -639.6 MB). Peak memory consumption was 260.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:50:35,438 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 145.2 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 17:50:35,442 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.33 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 101.4 MB in the beginning and 156.2 MB in the end (delta: -54.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:50:35,443 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.00 ms. Allocated memory is still 203.4 MB. Free memory was 156.2 MB in the beginning and 153.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:50:35,443 INFO L168 Benchmark]: Boogie Preprocessor took 41.96 ms. Allocated memory is still 203.4 MB. Free memory was 153.3 MB in the beginning and 150.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:50:35,444 INFO L168 Benchmark]: RCFGBuilder took 899.80 ms. Allocated memory is still 203.4 MB. Free memory was 150.3 MB in the beginning and 94.7 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:50:35,445 INFO L168 Benchmark]: TraceAbstraction took 25026.87 ms. Allocated memory was 203.4 MB in the beginning and 1.0 GB in the end (delta: 841.5 MB). Free memory was 93.8 MB in the beginning and 741.4 MB in the end (delta: -647.6 MB). Peak memory consumption was 193.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:50:35,453 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.19 ms. Allocated memory is still 145.2 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.33 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 101.4 MB in the beginning and 156.2 MB in the end (delta: -54.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.00 ms. Allocated memory is still 203.4 MB. Free memory was 156.2 MB in the beginning and 153.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.96 ms. Allocated memory is still 203.4 MB. Free memory was 153.3 MB in the beginning and 150.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 899.80 ms. Allocated memory is still 203.4 MB. Free memory was 150.3 MB in the beginning and 94.7 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25026.87 ms. Allocated memory was 203.4 MB in the beginning and 1.0 GB in the end (delta: 841.5 MB). Free memory was 93.8 MB in the beginning and 741.4 MB in the end (delta: -647.6 MB). Peak memory consumption was 193.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 191 ProgramPointsBefore, 113 ProgramPointsAfterwards, 246 TransitionsBefore, 136 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 35 ChoiceCompositions, 9685 VarBasedMoverChecksPositive, 320 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 419 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 0 MoverChecksTotal, 146813 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1725, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1726, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 x$w_buff1 = x$w_buff0 [L730] 1 x$w_buff0 = 1 [L731] 1 x$w_buff1_used = x$w_buff0_used [L732] 1 x$w_buff0_used = (_Bool)1 [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L746] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L747] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L748] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 [L776] 2 __unbuffered_p1_EAX = y [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 x$flush_delayed = weak$$choice2 [L782] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L784] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L785] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L786] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L786] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L787] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L791] 2 x = x$flush_delayed ? x$mem_tmp : x [L792] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 24.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3938 SDtfs, 4199 SDslu, 10052 SDs, 0 SdLazy, 3795 SolverSat, 221 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 86 SyntacticMatches, 17 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29658occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 13617 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 810 NumberOfCodeBlocks, 810 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 722 ConstructedInterpolants, 0 QuantifiedInterpolants, 194186 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...