/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:09:57,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:09:57,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:09:57,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:09:57,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:09:57,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:09:57,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:09:57,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:09:57,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:09:57,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:09:57,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:09:57,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:09:57,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:09:57,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:09:57,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:09:57,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:09:57,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:09:57,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:09:57,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:09:57,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:09:57,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:09:57,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:09:57,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:09:57,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:09:57,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:09:57,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:09:57,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:09:57,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:09:57,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:09:57,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:09:57,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:09:57,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:09:57,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:09:57,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:09:57,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:09:57,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:09:57,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:09:57,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:09:57,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:09:57,435 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:09:57,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:09:57,437 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-VariableLbe.epf [2019-12-18 21:09:57,451 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:09:57,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:09:57,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:09:57,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:09:57,453 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:09:57,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:09:57,453 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:09:57,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:09:57,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:09:57,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:09:57,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:09:57,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:09:57,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:09:57,454 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:09:57,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:09:57,455 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:09:57,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:09:57,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:09:57,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:09:57,455 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:09:57,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:09:57,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:09:57,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:09:57,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:09:57,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:09:57,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:09:57,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:09:57,457 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:09:57,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:09:57,457 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:09:57,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:09:57,743 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:09:57,747 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:09:57,748 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:09:57,749 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:09:57,749 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_pso.opt.i [2019-12-18 21:09:57,823 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f97d76823/5e82e3411d7341c2a991b87d8c79bee2/FLAGefc21a96d [2019-12-18 21:09:58,354 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:09:58,355 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_pso.opt.i [2019-12-18 21:09:58,375 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f97d76823/5e82e3411d7341c2a991b87d8c79bee2/FLAGefc21a96d [2019-12-18 21:09:58,648 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f97d76823/5e82e3411d7341c2a991b87d8c79bee2 [2019-12-18 21:09:58,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:09:58,661 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:09:58,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:09:58,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:09:58,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:09:58,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:09:58" (1/1) ... [2019-12-18 21:09:58,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eef5ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:09:58, skipping insertion in model container [2019-12-18 21:09:58,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:09:58" (1/1) ... [2019-12-18 21:09:58,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:09:58,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:09:59,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:09:59,234 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:09:59,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:09:59,365 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:09:59,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:09:59 WrapperNode [2019-12-18 21:09:59,365 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:09:59,366 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:09:59,366 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:09:59,366 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:09:59,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:09:59" (1/1) ... [2019-12-18 21:09:59,395 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:09:59" (1/1) ... [2019-12-18 21:09:59,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:09:59,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:09:59,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:09:59,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:09:59,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:09:59" (1/1) ... [2019-12-18 21:09:59,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:09:59" (1/1) ... [2019-12-18 21:09:59,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:09:59" (1/1) ... [2019-12-18 21:09:59,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:09:59" (1/1) ... [2019-12-18 21:09:59,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:09:59" (1/1) ... [2019-12-18 21:09:59,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:09:59" (1/1) ... [2019-12-18 21:09:59,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:09:59" (1/1) ... [2019-12-18 21:09:59,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:09:59,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:09:59,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:09:59,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:09:59,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:09:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:09:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:09:59,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:09:59,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:09:59,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:09:59,544 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:09:59,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:09:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:09:59,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:09:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:09:59,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:09:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:09:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:09:59,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:09:59,550 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:10:00,296 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:10:00,296 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:10:00,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:10:00 BoogieIcfgContainer [2019-12-18 21:10:00,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:10:00,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:10:00,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:10:00,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:10:00,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:09:58" (1/3) ... [2019-12-18 21:10:00,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2665fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:10:00, skipping insertion in model container [2019-12-18 21:10:00,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:09:59" (2/3) ... [2019-12-18 21:10:00,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f2665fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:10:00, skipping insertion in model container [2019-12-18 21:10:00,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:10:00" (3/3) ... [2019-12-18 21:10:00,307 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_pso.opt.i [2019-12-18 21:10:00,318 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:10:00,319 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:10:00,326 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:10:00,327 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:10:00,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,370 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,370 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,374 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,375 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,417 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,417 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,418 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,420 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,420 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,425 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,426 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,431 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,432 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,432 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,455 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,457 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,461 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,461 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,462 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:10:00,479 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:10:00,500 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:10:00,501 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:10:00,501 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:10:00,501 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:10:00,501 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:10:00,501 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:10:00,501 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:10:00,501 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:10:00,525 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 180 transitions [2019-12-18 21:10:00,528 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-12-18 21:10:00,649 INFO L126 PetriNetUnfolder]: 35/177 cut-off events. [2019-12-18 21:10:00,649 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:10:00,669 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 340 event pairs. 9/149 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 21:10:00,689 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 155 places, 180 transitions [2019-12-18 21:10:00,760 INFO L126 PetriNetUnfolder]: 35/177 cut-off events. [2019-12-18 21:10:00,760 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:10:00,768 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 35/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 340 event pairs. 9/149 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 21:10:00,786 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-18 21:10:00,787 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:10:03,564 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-12-18 21:10:04,239 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 21:10:04,382 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 21:10:04,417 INFO L206 etLargeBlockEncoding]: Checked pairs total: 43881 [2019-12-18 21:10:04,417 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 21:10:04,421 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 83 transitions [2019-12-18 21:10:05,153 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13626 states. [2019-12-18 21:10:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 13626 states. [2019-12-18 21:10:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 21:10:05,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:10:05,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:10:05,164 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:10:05,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:10:05,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1633137599, now seen corresponding path program 1 times [2019-12-18 21:10:05,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:10:05,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968231912] [2019-12-18 21:10:05,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:10:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:10:05,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:10:05,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968231912] [2019-12-18 21:10:05,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:10:05,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:10:05,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837708099] [2019-12-18 21:10:05,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:10:05,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:10:05,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:10:05,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:10:05,518 INFO L87 Difference]: Start difference. First operand 13626 states. Second operand 3 states. [2019-12-18 21:10:05,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:10:05,896 INFO L93 Difference]: Finished difference Result 13112 states and 50889 transitions. [2019-12-18 21:10:05,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:10:05,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 21:10:05,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:10:06,090 INFO L225 Difference]: With dead ends: 13112 [2019-12-18 21:10:06,090 INFO L226 Difference]: Without dead ends: 12332 [2019-12-18 21:10:06,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:10:06,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12332 states. [2019-12-18 21:10:06,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12332 to 12332. [2019-12-18 21:10:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12332 states. [2019-12-18 21:10:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12332 states to 12332 states and 47787 transitions. [2019-12-18 21:10:06,881 INFO L78 Accepts]: Start accepts. Automaton has 12332 states and 47787 transitions. Word has length 7 [2019-12-18 21:10:06,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:10:06,882 INFO L462 AbstractCegarLoop]: Abstraction has 12332 states and 47787 transitions. [2019-12-18 21:10:06,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:10:06,883 INFO L276 IsEmpty]: Start isEmpty. Operand 12332 states and 47787 transitions. [2019-12-18 21:10:06,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:10:06,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:10:06,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:10:06,895 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:10:06,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:10:06,895 INFO L82 PathProgramCache]: Analyzing trace with hash -812909038, now seen corresponding path program 1 times [2019-12-18 21:10:06,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:10:06,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009510123] [2019-12-18 21:10:06,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:10:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:10:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:10:07,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009510123] [2019-12-18 21:10:07,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:10:07,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:10:07,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234957300] [2019-12-18 21:10:07,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:10:07,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:10:07,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:10:07,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:10:07,028 INFO L87 Difference]: Start difference. First operand 12332 states and 47787 transitions. Second operand 3 states. [2019-12-18 21:10:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:10:07,185 INFO L93 Difference]: Finished difference Result 7395 states and 25096 transitions. [2019-12-18 21:10:07,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:10:07,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 21:10:07,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:10:07,233 INFO L225 Difference]: With dead ends: 7395 [2019-12-18 21:10:07,233 INFO L226 Difference]: Without dead ends: 7395 [2019-12-18 21:10:07,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:10:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7395 states. [2019-12-18 21:10:08,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7395 to 7395. [2019-12-18 21:10:08,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7395 states. [2019-12-18 21:10:08,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7395 states to 7395 states and 25096 transitions. [2019-12-18 21:10:08,273 INFO L78 Accepts]: Start accepts. Automaton has 7395 states and 25096 transitions. Word has length 13 [2019-12-18 21:10:08,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:10:08,273 INFO L462 AbstractCegarLoop]: Abstraction has 7395 states and 25096 transitions. [2019-12-18 21:10:08,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:10:08,273 INFO L276 IsEmpty]: Start isEmpty. Operand 7395 states and 25096 transitions. [2019-12-18 21:10:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:10:08,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:10:08,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:10:08,275 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:10:08,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:10:08,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1068045656, now seen corresponding path program 1 times [2019-12-18 21:10:08,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:10:08,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590643001] [2019-12-18 21:10:08,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:10:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:10:08,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:10:08,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590643001] [2019-12-18 21:10:08,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:10:08,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:10:08,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059811192] [2019-12-18 21:10:08,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:10:08,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:10:08,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:10:08,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:10:08,334 INFO L87 Difference]: Start difference. First operand 7395 states and 25096 transitions. Second operand 4 states. [2019-12-18 21:10:08,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:10:08,400 INFO L93 Difference]: Finished difference Result 1726 states and 4713 transitions. [2019-12-18 21:10:08,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:10:08,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 21:10:08,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:10:08,406 INFO L225 Difference]: With dead ends: 1726 [2019-12-18 21:10:08,406 INFO L226 Difference]: Without dead ends: 1726 [2019-12-18 21:10:08,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:10:08,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-12-18 21:10:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1726. [2019-12-18 21:10:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-12-18 21:10:08,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 4713 transitions. [2019-12-18 21:10:08,460 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 4713 transitions. Word has length 14 [2019-12-18 21:10:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:10:08,460 INFO L462 AbstractCegarLoop]: Abstraction has 1726 states and 4713 transitions. [2019-12-18 21:10:08,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:10:08,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 4713 transitions. [2019-12-18 21:10:08,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:10:08,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:10:08,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:10:08,462 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:10:08,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:10:08,463 INFO L82 PathProgramCache]: Analyzing trace with hash -902771085, now seen corresponding path program 1 times [2019-12-18 21:10:08,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:10:08,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268884704] [2019-12-18 21:10:08,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:10:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:10:08,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:10:08,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268884704] [2019-12-18 21:10:08,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:10:08,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:10:08,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908049999] [2019-12-18 21:10:08,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:10:08,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:10:08,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:10:08,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:10:08,517 INFO L87 Difference]: Start difference. First operand 1726 states and 4713 transitions. Second operand 3 states. [2019-12-18 21:10:08,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:10:08,624 INFO L93 Difference]: Finished difference Result 2578 states and 7057 transitions. [2019-12-18 21:10:08,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:10:08,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 21:10:08,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:10:08,635 INFO L225 Difference]: With dead ends: 2578 [2019-12-18 21:10:08,635 INFO L226 Difference]: Without dead ends: 2578 [2019-12-18 21:10:08,635 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-18 21:10:08,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2019-12-18 21:10:08,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1996. [2019-12-18 21:10:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1996 states. [2019-12-18 21:10:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 5570 transitions. [2019-12-18 21:10:08,718 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 5570 transitions. Word has length 16 [2019-12-18 21:10:08,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:10:08,719 INFO L462 AbstractCegarLoop]: Abstraction has 1996 states and 5570 transitions. [2019-12-18 21:10:08,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:10:08,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 5570 transitions. [2019-12-18 21:10:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:10:08,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:10:08,721 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:10:08,721 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:10:08,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:10:08,721 INFO L82 PathProgramCache]: Analyzing trace with hash -807708004, now seen corresponding path program 1 times [2019-12-18 21:10:08,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:10:08,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270064898] [2019-12-18 21:10:08,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:10:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:10:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:10:08,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270064898] [2019-12-18 21:10:08,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:10:08,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:10:08,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367121514] [2019-12-18 21:10:08,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:10:08,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:10:08,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:10:08,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:10:08,836 INFO L87 Difference]: Start difference. First operand 1996 states and 5570 transitions. Second operand 5 states. [2019-12-18 21:10:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:10:09,149 INFO L93 Difference]: Finished difference Result 2931 states and 7814 transitions. [2019-12-18 21:10:09,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:10:09,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 21:10:09,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:10:09,158 INFO L225 Difference]: With dead ends: 2931 [2019-12-18 21:10:09,158 INFO L226 Difference]: Without dead ends: 2931 [2019-12-18 21:10:09,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:10:09,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2019-12-18 21:10:09,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 2477. [2019-12-18 21:10:09,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2477 states. [2019-12-18 21:10:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 6729 transitions. [2019-12-18 21:10:09,232 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 6729 transitions. Word has length 16 [2019-12-18 21:10:09,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:10:09,232 INFO L462 AbstractCegarLoop]: Abstraction has 2477 states and 6729 transitions. [2019-12-18 21:10:09,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:10:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 6729 transitions. [2019-12-18 21:10:09,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:10:09,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:10:09,237 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] [2019-12-18 21:10:09,238 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:10:09,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:10:09,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1606250141, now seen corresponding path program 1 times [2019-12-18 21:10:09,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:10:09,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114958812] [2019-12-18 21:10:09,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:10:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:10:09,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:10:09,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114958812] [2019-12-18 21:10:09,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:10:09,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:10:09,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635847052] [2019-12-18 21:10:09,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:10:09,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:10:09,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:10:09,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:10:09,299 INFO L87 Difference]: Start difference. First operand 2477 states and 6729 transitions. Second operand 5 states. [2019-12-18 21:10:09,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:10:09,336 INFO L93 Difference]: Finished difference Result 1480 states and 4149 transitions. [2019-12-18 21:10:09,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:10:09,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-18 21:10:09,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:10:09,341 INFO L225 Difference]: With dead ends: 1480 [2019-12-18 21:10:09,341 INFO L226 Difference]: Without dead ends: 1480 [2019-12-18 21:10:09,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:10:09,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-12-18 21:10:09,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1432. [2019-12-18 21:10:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1432 states. [2019-12-18 21:10:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 4029 transitions. [2019-12-18 21:10:09,378 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 4029 transitions. Word has length 29 [2019-12-18 21:10:09,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:10:09,379 INFO L462 AbstractCegarLoop]: Abstraction has 1432 states and 4029 transitions. [2019-12-18 21:10:09,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:10:09,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 4029 transitions. [2019-12-18 21:10:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:10:09,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:10:09,386 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] [2019-12-18 21:10:09,386 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:10:09,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:10:09,387 INFO L82 PathProgramCache]: Analyzing trace with hash 2141548715, now seen corresponding path program 1 times [2019-12-18 21:10:09,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:10:09,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227846722] [2019-12-18 21:10:09,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:10:09,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:10:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:10:09,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227846722] [2019-12-18 21:10:09,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:10:09,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:10:09,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798213503] [2019-12-18 21:10:09,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:10:09,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:10:09,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:10:09,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:10:09,603 INFO L87 Difference]: Start difference. First operand 1432 states and 4029 transitions. Second operand 4 states. [2019-12-18 21:10:09,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:10:09,628 INFO L93 Difference]: Finished difference Result 2017 states and 5395 transitions. [2019-12-18 21:10:09,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:10:09,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-18 21:10:09,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:10:09,632 INFO L225 Difference]: With dead ends: 2017 [2019-12-18 21:10:09,633 INFO L226 Difference]: Without dead ends: 1290 [2019-12-18 21:10:09,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:10:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2019-12-18 21:10:09,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2019-12-18 21:10:09,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2019-12-18 21:10:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 3570 transitions. [2019-12-18 21:10:09,665 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 3570 transitions. Word has length 44 [2019-12-18 21:10:09,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:10:09,666 INFO L462 AbstractCegarLoop]: Abstraction has 1290 states and 3570 transitions. [2019-12-18 21:10:09,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:10:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 3570 transitions. [2019-12-18 21:10:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:10:09,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:10:09,671 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] [2019-12-18 21:10:09,671 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:10:09,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:10:09,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1012376631, now seen corresponding path program 2 times [2019-12-18 21:10:09,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:10:09,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463263706] [2019-12-18 21:10:09,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:10:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:10:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:10:09,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463263706] [2019-12-18 21:10:09,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:10:09,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:10:09,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913534675] [2019-12-18 21:10:09,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:10:09,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:10:09,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:10:09,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:10:09,741 INFO L87 Difference]: Start difference. First operand 1290 states and 3570 transitions. Second operand 3 states. [2019-12-18 21:10:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:10:09,756 INFO L93 Difference]: Finished difference Result 1699 states and 4565 transitions. [2019-12-18 21:10:09,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:10:09,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 21:10:09,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:10:09,759 INFO L225 Difference]: With dead ends: 1699 [2019-12-18 21:10:09,759 INFO L226 Difference]: Without dead ends: 441 [2019-12-18 21:10:09,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:10:09,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-12-18 21:10:09,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-12-18 21:10:09,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-12-18 21:10:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1050 transitions. [2019-12-18 21:10:09,770 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 1050 transitions. Word has length 44 [2019-12-18 21:10:09,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:10:09,770 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 1050 transitions. [2019-12-18 21:10:09,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:10:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 1050 transitions. [2019-12-18 21:10:09,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:10:09,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:10:09,772 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] [2019-12-18 21:10:09,772 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:10:09,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:10:09,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1658366409, now seen corresponding path program 3 times [2019-12-18 21:10:09,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:10:09,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268657291] [2019-12-18 21:10:09,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:10:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:10:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:10:09,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268657291] [2019-12-18 21:10:09,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:10:09,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:10:09,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358861015] [2019-12-18 21:10:09,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:10:09,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:10:09,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:10:09,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:10:09,863 INFO L87 Difference]: Start difference. First operand 441 states and 1050 transitions. Second operand 5 states. [2019-12-18 21:10:10,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:10:10,223 INFO L93 Difference]: Finished difference Result 802 states and 1822 transitions. [2019-12-18 21:10:10,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:10:10,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-18 21:10:10,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:10:10,228 INFO L225 Difference]: With dead ends: 802 [2019-12-18 21:10:10,229 INFO L226 Difference]: Without dead ends: 802 [2019-12-18 21:10:10,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:10:10,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-12-18 21:10:10,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 758. [2019-12-18 21:10:10,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-12-18 21:10:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1732 transitions. [2019-12-18 21:10:10,245 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1732 transitions. Word has length 44 [2019-12-18 21:10:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:10:10,246 INFO L462 AbstractCegarLoop]: Abstraction has 758 states and 1732 transitions. [2019-12-18 21:10:10,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:10:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1732 transitions. [2019-12-18 21:10:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:10:10,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:10:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:10:10,249 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:10:10,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:10:10,249 INFO L82 PathProgramCache]: Analyzing trace with hash 616615367, now seen corresponding path program 4 times [2019-12-18 21:10:10,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:10:10,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194278918] [2019-12-18 21:10:10,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:10:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:10:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:10:10,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194278918] [2019-12-18 21:10:10,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:10:10,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:10:10,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296433003] [2019-12-18 21:10:10,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:10:10,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:10:10,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:10:10,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:10:10,332 INFO L87 Difference]: Start difference. First operand 758 states and 1732 transitions. Second operand 7 states. [2019-12-18 21:10:10,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:10:10,588 INFO L93 Difference]: Finished difference Result 1956 states and 4215 transitions. [2019-12-18 21:10:10,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:10:10,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2019-12-18 21:10:10,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:10:10,593 INFO L225 Difference]: With dead ends: 1956 [2019-12-18 21:10:10,593 INFO L226 Difference]: Without dead ends: 1269 [2019-12-18 21:10:10,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:10:10,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-12-18 21:10:10,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 796. [2019-12-18 21:10:10,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-12-18 21:10:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1792 transitions. [2019-12-18 21:10:10,615 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1792 transitions. Word has length 44 [2019-12-18 21:10:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:10:10,616 INFO L462 AbstractCegarLoop]: Abstraction has 796 states and 1792 transitions. [2019-12-18 21:10:10,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:10:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1792 transitions. [2019-12-18 21:10:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 21:10:10,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:10:10,619 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] [2019-12-18 21:10:10,619 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:10:10,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:10:10,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1634630491, now seen corresponding path program 5 times [2019-12-18 21:10:10,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:10:10,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679140275] [2019-12-18 21:10:10,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:10:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:10:10,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-18 21:10:10,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679140275] [2019-12-18 21:10:10,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:10:10,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:10:10,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933125042] [2019-12-18 21:10:10,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:10:10,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:10:10,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:10:10,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:10:10,690 INFO L87 Difference]: Start difference. First operand 796 states and 1792 transitions. Second operand 3 states. [2019-12-18 21:10:10,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:10:10,705 INFO L93 Difference]: Finished difference Result 794 states and 1787 transitions. [2019-12-18 21:10:10,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:10:10,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-18 21:10:10,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:10:10,708 INFO L225 Difference]: With dead ends: 794 [2019-12-18 21:10:10,708 INFO L226 Difference]: Without dead ends: 794 [2019-12-18 21:10:10,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:10:10,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-12-18 21:10:10,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 717. [2019-12-18 21:10:10,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-12-18 21:10:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1644 transitions. [2019-12-18 21:10:10,724 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1644 transitions. Word has length 44 [2019-12-18 21:10:10,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:10:10,724 INFO L462 AbstractCegarLoop]: Abstraction has 717 states and 1644 transitions. [2019-12-18 21:10:10,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:10:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1644 transitions. [2019-12-18 21:10:10,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 21:10:10,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:10:10,727 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] [2019-12-18 21:10:10,727 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:10:10,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:10:10,727 INFO L82 PathProgramCache]: Analyzing trace with hash 759529029, now seen corresponding path program 1 times [2019-12-18 21:10:10,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:10:10,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854294445] [2019-12-18 21:10:10,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:10:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:10:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:10:10,827 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:10:10,827 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:10:10,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_70| 0 0))) (and (= 0 v_~z$r_buff1_thd0~0_24) (= 0 v_~z$r_buff1_thd1~0_10) (= 0 v_~z$w_buff1_used~0_56) (= 0 v_~__unbuffered_p1_EAX~0_15) (= v_~z$r_buff0_thd0~0_20 0) (= 0 |v_ULTIMATE.start_main_~#t882~0.offset_21|) (= 0 v_~__unbuffered_cnt~0_20) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_19) (= 0 v_~z$r_buff1_thd2~0_39) (= |v_#valid_68| (store .cse0 |v_ULTIMATE.start_main_~#t882~0.base_30| 1)) (= 0 v_~y~0_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t882~0.base_30|)) (= v_~z$r_buff0_thd2~0_68 0) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.base_5 0) (= 0 v_~z$mem_tmp~0_9) (< 0 |v_#StackHeapBarrier_18|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t882~0.base_30|) (= 0 v_~__unbuffered_p2_EAX~0_17) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~a~0_10 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$w_buff0_used~0_93 0) (= v_~z$r_buff0_thd1~0_9 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t882~0.base_30| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t882~0.base_30|) |v_ULTIMATE.start_main_~#t882~0.offset_21| 0)) |v_#memory_int_21|) (= v_~__unbuffered_p1_EBX~0_16 0) (= v_~z$r_buff0_thd3~0_27 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t882~0.base_30| 4)) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~z$flush_delayed~0_12) (= v_~__unbuffered_p2_EBX~0_17 0) (= 0 v_~weak$$choice0~0_6) (= 0 v_~z$w_buff0~0_26) (= v_~z~0_20 0) (= 0 v_~z$w_buff1~0_24) (= v_~b~0_12 0) (= v_~x~0_16 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_10, ULTIMATE.start_main_~#t882~0.base=|v_ULTIMATE.start_main_~#t882~0.base_30|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_17, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_56, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_11|, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ULTIMATE.start_main_~#t883~0.base=|v_ULTIMATE.start_main_~#t883~0.base_23|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_27, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_16, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_~#t884~0.base=|v_ULTIMATE.start_main_~#t884~0.base_19|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ULTIMATE.start_main_~#t884~0.offset=|v_ULTIMATE.start_main_~#t884~0.offset_16|, ~y~0=v_~y~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_68, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_~#t883~0.offset=|v_ULTIMATE.start_main_~#t883~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t882~0.offset=|v_ULTIMATE.start_main_~#t882~0.offset_21|, ~b~0=v_~b~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ULTIMATE.start_main_~#t882~0.base, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_~#t883~0.base, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t884~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t884~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t883~0.offset, #NULL.base, ULTIMATE.start_main_~#t882~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:10:10,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L830-1-->L832: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t883~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t883~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t883~0.base_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t883~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t883~0.base_11|) |v_ULTIMATE.start_main_~#t883~0.offset_10| 1)) |v_#memory_int_11|) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t883~0.base_11| 1) |v_#valid_39|) (not (= 0 |v_ULTIMATE.start_main_~#t883~0.base_11|)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t883~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t883~0.base=|v_ULTIMATE.start_main_~#t883~0.base_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t883~0.offset=|v_ULTIMATE.start_main_~#t883~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t883~0.base, #length, ULTIMATE.start_main_~#t883~0.offset] because there is no mapped edge [2019-12-18 21:10:10,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t884~0.base_13|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t884~0.base_13|) 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t884~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t884~0.base_13| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t884~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t884~0.base_13|) |v_ULTIMATE.start_main_~#t884~0.offset_11| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t884~0.offset_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t884~0.base_13| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t884~0.base=|v_ULTIMATE.start_main_~#t884~0.base_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t884~0.offset=|v_ULTIMATE.start_main_~#t884~0.offset_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t884~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t884~0.offset, #length] because there is no mapped edge [2019-12-18 21:10:10,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L4-->L807: Formula: (and (= 1 v_~a~0_4) (= v_~z$r_buff0_thd2~0_45 v_~z$r_buff1_thd2~0_26) (= v_~z$r_buff1_thd1~0_4 v_~z$r_buff0_thd1~0_5) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6)) (= v_~z$r_buff0_thd3~0_22 v_~z$r_buff1_thd3~0_12) (= v_~z$r_buff0_thd0~0_16 v_~z$r_buff1_thd0~0_11) (= v_~__unbuffered_p2_EBX~0_5 v_~b~0_5) (= v_~__unbuffered_p2_EAX~0_5 v_~a~0_4) (= v_~z$r_buff0_thd3~0_21 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~b~0=v_~b~0_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_22, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_45} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_5, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_26, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_6, ~a~0=v_~a~0_4, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~b~0=v_~b~0_5, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_4, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_5, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_5, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_45} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p2_EBX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0] because there is no mapped edge [2019-12-18 21:10:10,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~b~0_8) (= 1 v_~x~0_7) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, ~x~0=v_~x~0_7, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:10:10,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-640217511 256) 0))) (or (and (= ~z$w_buff0_used~0_In-640217511 |P1Thread1of1ForFork1_#t~ite15_Out-640217511|) (= |P1Thread1of1ForFork1_#t~ite14_In-640217511| |P1Thread1of1ForFork1_#t~ite14_Out-640217511|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out-640217511| |P1Thread1of1ForFork1_#t~ite14_Out-640217511|) (= ~z$w_buff0_used~0_In-640217511 |P1Thread1of1ForFork1_#t~ite14_Out-640217511|) (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-640217511 256) 0))) (or (and (= (mod ~z$r_buff1_thd2~0_In-640217511 256) 0) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In-640217511 256)) .cse1) (= (mod ~z$w_buff0_used~0_In-640217511 256) 0))) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-640217511, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-640217511, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-640217511, ~weak$$choice2~0=~weak$$choice2~0_In-640217511, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-640217511, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-640217511|} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-640217511, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-640217511, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-640217511, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-640217511|, ~weak$$choice2~0=~weak$$choice2~0_In-640217511, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-640217511|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-640217511} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 21:10:10,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L770-->L771: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd2~0_59 v_~z$r_buff0_thd2~0_58)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_59} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_9|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_10|, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_58} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 21:10:10,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L773-->L781: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 21:10:10,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In246712387 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In246712387 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite28_Out246712387| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite28_Out246712387| ~z$w_buff0_used~0_In246712387) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In246712387, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In246712387} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In246712387, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In246712387, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out246712387|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 21:10:10,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1017734785 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1017734785 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1017734785 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1017734785 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite29_Out-1017734785|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-1017734785 |P2Thread1of1ForFork2_#t~ite29_Out-1017734785|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1017734785, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1017734785, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1017734785, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1017734785} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1017734785, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1017734785, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1017734785, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1017734785, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1017734785|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 21:10:10,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L810-->L811: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1486882560 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1486882560 256)))) (or (and (= ~z$r_buff0_thd3~0_Out1486882560 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd3~0_Out1486882560 ~z$r_buff0_thd3~0_In1486882560) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1486882560, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1486882560} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out1486882560|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1486882560, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out1486882560} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 21:10:10,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In1998931323 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1998931323 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1998931323 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1998931323 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite31_Out1998931323|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In1998931323 |P2Thread1of1ForFork2_#t~ite31_Out1998931323|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1998931323, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1998931323, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1998931323, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1998931323} OutVars{P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out1998931323|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1998931323, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1998931323, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1998931323, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1998931323} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 21:10:10,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L811-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite31_8| v_~z$r_buff1_thd3~0_15)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_15, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 21:10:10,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L834-1-->L840: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:10:10,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L840-2-->L840-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1250148957 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1250148957 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out1250148957| ~z$w_buff1~0_In1250148957) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite35_Out1250148957| ~z~0_In1250148957)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1250148957, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1250148957, ~z$w_buff1~0=~z$w_buff1~0_In1250148957, ~z~0=~z~0_In1250148957} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1250148957, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1250148957|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1250148957, ~z$w_buff1~0=~z$w_buff1~0_In1250148957, ~z~0=~z~0_In1250148957} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-18 21:10:10,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L840-4-->L841: Formula: (= v_~z~0_14 |v_ULTIMATE.start_main_#t~ite35_8|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_8|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|, ~z~0=v_~z~0_14} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-12-18 21:10:10,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-175275901 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-175275901 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out-175275901| ~z$w_buff0_used~0_In-175275901)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite37_Out-175275901| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-175275901, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-175275901} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-175275901, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-175275901, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-175275901|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 21:10:10,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L842-->L842-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-290896833 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-290896833 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-290896833 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-290896833 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-290896833| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite38_Out-290896833| ~z$w_buff1_used~0_In-290896833) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-290896833, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-290896833, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-290896833, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-290896833} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-290896833, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-290896833, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-290896833, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-290896833, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-290896833|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:10:10,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L843-->L843-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1679622757 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1679622757 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1679622757 |ULTIMATE.start_main_#t~ite39_Out1679622757|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite39_Out1679622757|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1679622757, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1679622757} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1679622757, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1679622757|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1679622757} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:10:10,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1177015746 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1177015746 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1177015746 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1177015746 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite40_Out-1177015746| 0)) (and (= |ULTIMATE.start_main_#t~ite40_Out-1177015746| ~z$r_buff1_thd0~0_In-1177015746) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1177015746, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1177015746, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1177015746, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1177015746} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1177015746, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1177015746|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1177015746, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1177015746, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1177015746} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:10:10,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= |v_ULTIMATE.start_main_#t~ite40_14| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EBX~0_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 1 v_~__unbuffered_p1_EAX~0_9) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~__unbuffered_p1_EBX~0_10 0) (= 1 v_~__unbuffered_p2_EAX~0_11) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_11, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_11, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~x~0=v_~x~0_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:10:10,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:10:10 BasicIcfg [2019-12-18 21:10:10,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:10:10,996 INFO L168 Benchmark]: Toolchain (without parser) took 12335.53 ms. Allocated memory was 138.9 MB in the beginning and 591.9 MB in the end (delta: 453.0 MB). Free memory was 100.7 MB in the beginning and 437.0 MB in the end (delta: -336.3 MB). Peak memory consumption was 332.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:10:10,996 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 21:10:10,997 INFO L168 Benchmark]: CACSL2BoogieTranslator took 703.93 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 100.5 MB in the beginning and 156.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:10:10,998 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.57 ms. Allocated memory is still 201.9 MB. Free memory was 156.2 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:10:10,999 INFO L168 Benchmark]: Boogie Preprocessor took 37.98 ms. Allocated memory is still 201.9 MB. Free memory was 153.6 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:10:10,999 INFO L168 Benchmark]: RCFGBuilder took 826.00 ms. Allocated memory is still 201.9 MB. Free memory was 151.0 MB in the beginning and 107.3 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:10:11,000 INFO L168 Benchmark]: TraceAbstraction took 10694.63 ms. Allocated memory was 201.9 MB in the beginning and 591.9 MB in the end (delta: 390.1 MB). Free memory was 106.7 MB in the beginning and 437.0 MB in the end (delta: -330.4 MB). Peak memory consumption was 275.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:10:11,004 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 703.93 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 100.5 MB in the beginning and 156.2 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.57 ms. Allocated memory is still 201.9 MB. Free memory was 156.2 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.98 ms. Allocated memory is still 201.9 MB. Free memory was 153.6 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 826.00 ms. Allocated memory is still 201.9 MB. Free memory was 151.0 MB in the beginning and 107.3 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10694.63 ms. Allocated memory was 201.9 MB in the beginning and 591.9 MB in the end (delta: 390.1 MB). Free memory was 106.7 MB in the beginning and 437.0 MB in the end (delta: -330.4 MB). Peak memory consumption was 275.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 155 ProgramPointsBefore, 73 ProgramPointsAfterwards, 180 TransitionsBefore, 83 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 19 ChoiceCompositions, 4740 VarBasedMoverChecksPositive, 133 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 43881 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t882, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t883, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t884, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$w_buff1 = z$w_buff0 [L787] 3 z$w_buff0 = 1 [L788] 3 z$w_buff1_used = z$w_buff0_used [L789] 3 z$w_buff0_used = (_Bool)1 [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 z$flush_delayed = weak$$choice2 [L764] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L766] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L768] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L840] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L843] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 146 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.3s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1225 SDtfs, 1138 SDslu, 1963 SDs, 0 SdLazy, 742 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13626occurred 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: 2.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 1678 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 28102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...