/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe022_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:56:19,409 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:56:19,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:56:19,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:56:19,430 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:56:19,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:56:19,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:56:19,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:56:19,446 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:56:19,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:56:19,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:56:19,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:56:19,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:56:19,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:56:19,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:56:19,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:56:19,459 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:56:19,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:56:19,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:56:19,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:56:19,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:56:19,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:56:19,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:56:19,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:56:19,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:56:19,477 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:56:19,477 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:56:19,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:56:19,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:56:19,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:56:19,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:56:19,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:56:19,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:56:19,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:56:19,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:56:19,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:56:19,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:56:19,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:56:19,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:56:19,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:56:19,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:56:19,489 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:56:19,515 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:56:19,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:56:19,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:56:19,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:56:19,517 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:56:19,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:56:19,518 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:56:19,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:56:19,518 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:56:19,518 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:56:19,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:56:19,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:56:19,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:56:19,519 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:56:19,519 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:56:19,519 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:56:19,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:56:19,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:56:19,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:56:19,520 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:56:19,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:56:19,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:56:19,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:56:19,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:56:19,521 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:56:19,521 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:56:19,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:56:19,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:56:19,522 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:56:19,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:56:19,818 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:56:19,822 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:56:19,823 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:56:19,823 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:56:19,824 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_rmo.opt.i [2019-12-27 03:56:19,901 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4e8cd2a9/282988b3e3e74954a126fcfe2b4127bd/FLAG2044345e9 [2019-12-27 03:56:20,418 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:56:20,419 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_rmo.opt.i [2019-12-27 03:56:20,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4e8cd2a9/282988b3e3e74954a126fcfe2b4127bd/FLAG2044345e9 [2019-12-27 03:56:20,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4e8cd2a9/282988b3e3e74954a126fcfe2b4127bd [2019-12-27 03:56:20,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:56:20,705 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:56:20,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:56:20,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:56:20,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:56:20,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:56:20" (1/1) ... [2019-12-27 03:56:20,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2250643d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:20, skipping insertion in model container [2019-12-27 03:56:20,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:56:20" (1/1) ... [2019-12-27 03:56:20,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:56:20,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:56:21,315 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:56:21,327 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:56:21,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:56:21,459 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:56:21,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:21 WrapperNode [2019-12-27 03:56:21,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:56:21,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:56:21,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:56:21,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:56:21,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:21" (1/1) ... [2019-12-27 03:56:21,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:21" (1/1) ... [2019-12-27 03:56:21,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:56:21,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:56:21,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:56:21,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:56:21,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:21" (1/1) ... [2019-12-27 03:56:21,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:21" (1/1) ... [2019-12-27 03:56:21,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:21" (1/1) ... [2019-12-27 03:56:21,541 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:21" (1/1) ... [2019-12-27 03:56:21,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:21" (1/1) ... [2019-12-27 03:56:21,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:21" (1/1) ... [2019-12-27 03:56:21,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:21" (1/1) ... [2019-12-27 03:56:21,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:56:21,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:56:21,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:56:21,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:56:21,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:56:21,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:56:21,621 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:56:21,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:56:21,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:56:21,622 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:56:21,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:56:21,622 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:56:21,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:56:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:56:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:56:21,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:56:21,625 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:56:22,299 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:56:22,299 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:56:22,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:56:22 BoogieIcfgContainer [2019-12-27 03:56:22,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:56:22,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:56:22,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:56:22,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:56:22,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:56:20" (1/3) ... [2019-12-27 03:56:22,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ce8dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:56:22, skipping insertion in model container [2019-12-27 03:56:22,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:56:21" (2/3) ... [2019-12-27 03:56:22,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ce8dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:56:22, skipping insertion in model container [2019-12-27 03:56:22,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:56:22" (3/3) ... [2019-12-27 03:56:22,314 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_rmo.opt.i [2019-12-27 03:56:22,324 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:56:22,325 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:56:22,332 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:56:22,333 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:56:22,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,369 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,369 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,370 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,370 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,371 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,380 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,380 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,413 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,413 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,414 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,420 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,444 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:56:22,461 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 03:56:22,478 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:56:22,478 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:56:22,479 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:56:22,479 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:56:22,479 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:56:22,479 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:56:22,479 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:56:22,479 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:56:22,495 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 03:56:22,497 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 03:56:22,586 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 03:56:22,586 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:56:22,603 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 03:56:22,625 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 03:56:22,670 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 03:56:22,671 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:56:22,676 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 03:56:22,690 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 03:56:22,691 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:56:27,112 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 03:56:27,280 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-27 03:56:27,281 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-27 03:56:27,283 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-27 03:56:27,682 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-27 03:56:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-27 03:56:27,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 03:56:27,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:27,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 03:56:27,691 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:27,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:27,698 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-27 03:56:27,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:27,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695812694] [2019-12-27 03:56:27,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:27,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695812694] [2019-12-27 03:56:27,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:27,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:56:27,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536568953] [2019-12-27 03:56:27,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:56:27,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:27,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:56:27,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:56:27,932 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-27 03:56:28,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:28,142 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-27 03:56:28,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:56:28,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 03:56:28,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:28,252 INFO L225 Difference]: With dead ends: 8074 [2019-12-27 03:56:28,252 INFO L226 Difference]: Without dead ends: 7606 [2019-12-27 03:56:28,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:56:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-27 03:56:28,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-27 03:56:28,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-27 03:56:28,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-27 03:56:28,612 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-27 03:56:28,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:28,612 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-27 03:56:28,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:56:28,613 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-27 03:56:28,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 03:56:28,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:28,616 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:28,616 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:28,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:28,617 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-27 03:56:28,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:28,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582237933] [2019-12-27 03:56:28,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:28,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:28,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582237933] [2019-12-27 03:56:28,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:28,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:56:28,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602497167] [2019-12-27 03:56:28,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:56:28,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:28,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:56:28,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:56:28,711 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-27 03:56:29,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:29,259 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-27 03:56:29,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:56:29,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 03:56:29,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:29,327 INFO L225 Difference]: With dead ends: 11630 [2019-12-27 03:56:29,328 INFO L226 Difference]: Without dead ends: 11623 [2019-12-27 03:56:29,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:56:29,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-27 03:56:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-27 03:56:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-27 03:56:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-27 03:56:29,723 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-27 03:56:29,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:29,724 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-27 03:56:29,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:56:29,724 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-27 03:56:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:56:29,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:29,733 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:29,734 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:29,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:29,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-27 03:56:29,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:29,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011015202] [2019-12-27 03:56:29,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:29,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:29,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011015202] [2019-12-27 03:56:29,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:29,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:56:29,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291115682] [2019-12-27 03:56:29,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:56:29,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:29,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:56:29,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:56:29,871 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-27 03:56:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:30,713 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-27 03:56:30,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:56:30,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 03:56:30,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:30,761 INFO L225 Difference]: With dead ends: 14471 [2019-12-27 03:56:30,761 INFO L226 Difference]: Without dead ends: 14471 [2019-12-27 03:56:30,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:56:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-27 03:56:31,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-27 03:56:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-27 03:56:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-27 03:56:31,159 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-27 03:56:31,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:31,162 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-27 03:56:31,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:56:31,162 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-27 03:56:31,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 03:56:31,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:31,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:31,167 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:31,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:31,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-27 03:56:31,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:31,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240057561] [2019-12-27 03:56:31,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:31,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:31,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240057561] [2019-12-27 03:56:31,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:31,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:56:31,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013787184] [2019-12-27 03:56:31,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:56:31,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:31,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:56:31,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:56:31,247 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-27 03:56:31,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:31,304 INFO L93 Difference]: Finished difference Result 11335 states and 35719 transitions. [2019-12-27 03:56:31,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:56:31,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 03:56:31,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:31,344 INFO L225 Difference]: With dead ends: 11335 [2019-12-27 03:56:31,344 INFO L226 Difference]: Without dead ends: 11335 [2019-12-27 03:56:31,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:56:31,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11335 states. [2019-12-27 03:56:31,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11335 to 11335. [2019-12-27 03:56:31,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11335 states. [2019-12-27 03:56:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11335 states to 11335 states and 35719 transitions. [2019-12-27 03:56:31,760 INFO L78 Accepts]: Start accepts. Automaton has 11335 states and 35719 transitions. Word has length 16 [2019-12-27 03:56:31,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:31,760 INFO L462 AbstractCegarLoop]: Abstraction has 11335 states and 35719 transitions. [2019-12-27 03:56:31,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:56:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 11335 states and 35719 transitions. [2019-12-27 03:56:31,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 03:56:31,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:31,764 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:31,765 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:31,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:31,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1732892148, now seen corresponding path program 1 times [2019-12-27 03:56:31,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:31,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864880722] [2019-12-27 03:56:31,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:31,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864880722] [2019-12-27 03:56:31,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:31,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:56:31,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545037019] [2019-12-27 03:56:31,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:56:31,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:31,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:56:31,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:56:31,843 INFO L87 Difference]: Start difference. First operand 11335 states and 35719 transitions. Second operand 4 states. [2019-12-27 03:56:31,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:31,937 INFO L93 Difference]: Finished difference Result 18566 states and 58786 transitions. [2019-12-27 03:56:31,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:56:31,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 03:56:31,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:31,968 INFO L225 Difference]: With dead ends: 18566 [2019-12-27 03:56:31,968 INFO L226 Difference]: Without dead ends: 9176 [2019-12-27 03:56:31,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:56:32,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9176 states. [2019-12-27 03:56:32,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9176 to 9176. [2019-12-27 03:56:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9176 states. [2019-12-27 03:56:32,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 28440 transitions. [2019-12-27 03:56:32,237 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 28440 transitions. Word has length 17 [2019-12-27 03:56:32,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:32,238 INFO L462 AbstractCegarLoop]: Abstraction has 9176 states and 28440 transitions. [2019-12-27 03:56:32,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:56:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 28440 transitions. [2019-12-27 03:56:32,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 03:56:32,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:32,251 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:32,252 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:32,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:32,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1167521807, now seen corresponding path program 1 times [2019-12-27 03:56:32,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:32,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655307464] [2019-12-27 03:56:32,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:32,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:32,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655307464] [2019-12-27 03:56:32,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:32,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:56:32,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036375196] [2019-12-27 03:56:32,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:56:32,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:32,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:56:32,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:56:32,344 INFO L87 Difference]: Start difference. First operand 9176 states and 28440 transitions. Second operand 4 states. [2019-12-27 03:56:32,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:32,379 INFO L93 Difference]: Finished difference Result 1638 states and 4028 transitions. [2019-12-27 03:56:32,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:56:32,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 03:56:32,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:32,383 INFO L225 Difference]: With dead ends: 1638 [2019-12-27 03:56:32,384 INFO L226 Difference]: Without dead ends: 1206 [2019-12-27 03:56:32,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:56:32,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2019-12-27 03:56:32,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1206. [2019-12-27 03:56:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1206 states. [2019-12-27 03:56:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 2674 transitions. [2019-12-27 03:56:32,406 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 2674 transitions. Word has length 18 [2019-12-27 03:56:32,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:32,406 INFO L462 AbstractCegarLoop]: Abstraction has 1206 states and 2674 transitions. [2019-12-27 03:56:32,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:56:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 2674 transitions. [2019-12-27 03:56:32,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 03:56:32,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:32,409 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] [2019-12-27 03:56:32,409 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:32,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:32,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-27 03:56:32,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:32,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171089167] [2019-12-27 03:56:32,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:32,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171089167] [2019-12-27 03:56:32,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:32,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:56:32,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836321633] [2019-12-27 03:56:32,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:56:32,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:32,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:56:32,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:56:32,659 INFO L87 Difference]: Start difference. First operand 1206 states and 2674 transitions. Second operand 6 states. [2019-12-27 03:56:32,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:32,840 INFO L93 Difference]: Finished difference Result 1222 states and 2679 transitions. [2019-12-27 03:56:32,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 03:56:32,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 03:56:32,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:32,843 INFO L225 Difference]: With dead ends: 1222 [2019-12-27 03:56:32,843 INFO L226 Difference]: Without dead ends: 1170 [2019-12-27 03:56:32,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:56:32,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-12-27 03:56:32,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1149. [2019-12-27 03:56:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2019-12-27 03:56:32,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 2552 transitions. [2019-12-27 03:56:32,876 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 2552 transitions. Word has length 24 [2019-12-27 03:56:32,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:32,876 INFO L462 AbstractCegarLoop]: Abstraction has 1149 states and 2552 transitions. [2019-12-27 03:56:32,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:56:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 2552 transitions. [2019-12-27 03:56:32,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 03:56:32,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:32,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:32,879 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:32,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:32,879 INFO L82 PathProgramCache]: Analyzing trace with hash -451164714, now seen corresponding path program 1 times [2019-12-27 03:56:32,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:32,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28386760] [2019-12-27 03:56:32,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:32,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28386760] [2019-12-27 03:56:32,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:32,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:56:32,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045704137] [2019-12-27 03:56:32,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:56:32,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:32,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:56:32,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:56:32,998 INFO L87 Difference]: Start difference. First operand 1149 states and 2552 transitions. Second operand 5 states. [2019-12-27 03:56:33,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:33,465 INFO L93 Difference]: Finished difference Result 1862 states and 4038 transitions. [2019-12-27 03:56:33,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:56:33,465 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 03:56:33,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:33,469 INFO L225 Difference]: With dead ends: 1862 [2019-12-27 03:56:33,470 INFO L226 Difference]: Without dead ends: 1862 [2019-12-27 03:56:33,470 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-27 03:56:33,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2019-12-27 03:56:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1665. [2019-12-27 03:56:33,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1665 states. [2019-12-27 03:56:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 3660 transitions. [2019-12-27 03:56:33,500 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 3660 transitions. Word has length 27 [2019-12-27 03:56:33,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:33,501 INFO L462 AbstractCegarLoop]: Abstraction has 1665 states and 3660 transitions. [2019-12-27 03:56:33,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:56:33,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 3660 transitions. [2019-12-27 03:56:33,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 03:56:33,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:33,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:33,504 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:33,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:33,505 INFO L82 PathProgramCache]: Analyzing trace with hash 747998845, now seen corresponding path program 1 times [2019-12-27 03:56:33,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:33,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021096635] [2019-12-27 03:56:33,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:33,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021096635] [2019-12-27 03:56:33,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:33,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:56:33,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151155165] [2019-12-27 03:56:33,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:56:33,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:33,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:56:33,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:56:33,585 INFO L87 Difference]: Start difference. First operand 1665 states and 3660 transitions. Second operand 5 states. [2019-12-27 03:56:33,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:33,628 INFO L93 Difference]: Finished difference Result 974 states and 2029 transitions. [2019-12-27 03:56:33,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:56:33,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 03:56:33,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:33,630 INFO L225 Difference]: With dead ends: 974 [2019-12-27 03:56:33,630 INFO L226 Difference]: Without dead ends: 842 [2019-12-27 03:56:33,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:56:33,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-12-27 03:56:33,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 800. [2019-12-27 03:56:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-12-27 03:56:33,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1708 transitions. [2019-12-27 03:56:33,645 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1708 transitions. Word has length 28 [2019-12-27 03:56:33,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:33,646 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1708 transitions. [2019-12-27 03:56:33,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:56:33,646 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1708 transitions. [2019-12-27 03:56:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 03:56:33,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:33,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:33,649 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:33,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:33,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1290466760, now seen corresponding path program 1 times [2019-12-27 03:56:33,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:33,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737619551] [2019-12-27 03:56:33,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:33,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:33,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737619551] [2019-12-27 03:56:33,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:33,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:56:33,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252364235] [2019-12-27 03:56:33,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:56:33,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:33,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:56:33,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:56:33,809 INFO L87 Difference]: Start difference. First operand 800 states and 1708 transitions. Second operand 7 states. [2019-12-27 03:56:33,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:33,998 INFO L93 Difference]: Finished difference Result 1394 states and 2892 transitions. [2019-12-27 03:56:33,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 03:56:33,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-27 03:56:33,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:34,000 INFO L225 Difference]: With dead ends: 1394 [2019-12-27 03:56:34,000 INFO L226 Difference]: Without dead ends: 931 [2019-12-27 03:56:34,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 03:56:34,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-27 03:56:34,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 792. [2019-12-27 03:56:34,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-12-27 03:56:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1676 transitions. [2019-12-27 03:56:34,014 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1676 transitions. Word has length 50 [2019-12-27 03:56:34,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:34,014 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1676 transitions. [2019-12-27 03:56:34,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:56:34,014 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1676 transitions. [2019-12-27 03:56:34,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 03:56:34,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:34,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:34,017 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:34,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:34,017 INFO L82 PathProgramCache]: Analyzing trace with hash 50774886, now seen corresponding path program 2 times [2019-12-27 03:56:34,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:34,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028031428] [2019-12-27 03:56:34,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:34,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028031428] [2019-12-27 03:56:34,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:34,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:56:34,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565583392] [2019-12-27 03:56:34,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:56:34,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:34,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:56:34,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:56:34,097 INFO L87 Difference]: Start difference. First operand 792 states and 1676 transitions. Second operand 3 states. [2019-12-27 03:56:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:34,167 INFO L93 Difference]: Finished difference Result 1051 states and 2216 transitions. [2019-12-27 03:56:34,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:56:34,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 03:56:34,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:34,170 INFO L225 Difference]: With dead ends: 1051 [2019-12-27 03:56:34,170 INFO L226 Difference]: Without dead ends: 1051 [2019-12-27 03:56:34,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:56:34,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-12-27 03:56:34,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 849. [2019-12-27 03:56:34,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-12-27 03:56:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1815 transitions. [2019-12-27 03:56:34,192 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1815 transitions. Word has length 50 [2019-12-27 03:56:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:34,193 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1815 transitions. [2019-12-27 03:56:34,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:56:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1815 transitions. [2019-12-27 03:56:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 03:56:34,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:34,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:34,196 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:34,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:34,196 INFO L82 PathProgramCache]: Analyzing trace with hash 925752847, now seen corresponding path program 1 times [2019-12-27 03:56:34,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:34,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479445565] [2019-12-27 03:56:34,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:34,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479445565] [2019-12-27 03:56:34,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:34,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:56:34,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855126374] [2019-12-27 03:56:34,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:56:34,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:34,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:56:34,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:56:34,370 INFO L87 Difference]: Start difference. First operand 849 states and 1815 transitions. Second operand 6 states. [2019-12-27 03:56:34,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:34,874 INFO L93 Difference]: Finished difference Result 1004 states and 2107 transitions. [2019-12-27 03:56:34,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:56:34,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-27 03:56:34,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:34,877 INFO L225 Difference]: With dead ends: 1004 [2019-12-27 03:56:34,877 INFO L226 Difference]: Without dead ends: 1004 [2019-12-27 03:56:34,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:56:34,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-12-27 03:56:34,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 909. [2019-12-27 03:56:34,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-12-27 03:56:34,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1931 transitions. [2019-12-27 03:56:34,893 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1931 transitions. Word has length 51 [2019-12-27 03:56:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:34,894 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1931 transitions. [2019-12-27 03:56:34,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:56:34,894 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1931 transitions. [2019-12-27 03:56:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 03:56:34,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:34,896 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:34,897 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:34,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:34,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1086861075, now seen corresponding path program 2 times [2019-12-27 03:56:34,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:34,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304210082] [2019-12-27 03:56:34,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:56:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:56:34,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304210082] [2019-12-27 03:56:34,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:56:34,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:56:34,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028915202] [2019-12-27 03:56:34,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:56:34,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:56:34,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:56:34,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:56:34,978 INFO L87 Difference]: Start difference. First operand 909 states and 1931 transitions. Second operand 3 states. [2019-12-27 03:56:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:56:34,990 INFO L93 Difference]: Finished difference Result 908 states and 1929 transitions. [2019-12-27 03:56:34,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:56:34,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 03:56:34,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:56:34,992 INFO L225 Difference]: With dead ends: 908 [2019-12-27 03:56:34,992 INFO L226 Difference]: Without dead ends: 908 [2019-12-27 03:56:34,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:56:34,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-12-27 03:56:35,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 754. [2019-12-27 03:56:35,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-27 03:56:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-27 03:56:35,082 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-27 03:56:35,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:56:35,082 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-27 03:56:35,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:56:35,083 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-27 03:56:35,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 03:56:35,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:56:35,085 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:56:35,085 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:56:35,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:56:35,086 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-27 03:56:35,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:56:35,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573664668] [2019-12-27 03:56:35,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:56:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:56:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 03:56:35,188 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 03:56:35,189 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 03:56:35,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2315~0.base_48| 4)) (= |v_#NULL.offset_6| 0) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 v_~y$r_buff0_thd2~0_324) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2315~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2315~0.base_48|) |v_ULTIMATE.start_main_~#t2315~0.offset_31| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd0~0_129 0) (= v_~y$read_delayed~0_6 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2315~0.base_48|) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= |v_ULTIMATE.start_main_~#t2315~0.offset_31| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2315~0.base_48|) 0) (= v_~y~0_137 0) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t2315~0.base_48| 1)) (= v_~y$r_buff1_thd1~0_115 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ULTIMATE.start_main_~#t2316~0.offset=|v_ULTIMATE.start_main_~#t2316~0.offset_31|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t2316~0.base=|v_ULTIMATE.start_main_~#t2316~0.base_49|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2315~0.offset=|v_ULTIMATE.start_main_~#t2315~0.offset_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t2315~0.base=|v_ULTIMATE.start_main_~#t2315~0.base_48|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2316~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2316~0.base, #NULL.base, ULTIMATE.start_main_~#t2315~0.offset, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t2315~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:56:35,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2316~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2316~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t2316~0.offset_11| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2316~0.base_13| 1)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2316~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2316~0.base_13|) |v_ULTIMATE.start_main_~#t2316~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t2316~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2316~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2316~0.base=|v_ULTIMATE.start_main_~#t2316~0.base_13|, ULTIMATE.start_main_~#t2316~0.offset=|v_ULTIMATE.start_main_~#t2316~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2316~0.base, ULTIMATE.start_main_~#t2316~0.offset] because there is no mapped edge [2019-12-27 03:56:35,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~x~0_Out1261366109 1) (= ~y$r_buff1_thd0~0_Out1261366109 ~y$r_buff0_thd0~0_In1261366109) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1261366109)) (= ~y$r_buff1_thd1~0_Out1261366109 ~y$r_buff0_thd1~0_In1261366109) (= 1 ~y$r_buff0_thd1~0_Out1261366109) (= ~y$r_buff1_thd2~0_Out1261366109 ~y$r_buff0_thd2~0_In1261366109)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1261366109, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1261366109, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1261366109, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1261366109} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1261366109, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1261366109, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1261366109, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1261366109, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1261366109, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1261366109, ~x~0=~x~0_Out1261366109, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1261366109} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 03:56:35,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1248951138 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1248951138 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1248951138|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1248951138 |P0Thread1of1ForFork0_#t~ite5_Out-1248951138|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1248951138, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1248951138} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1248951138|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1248951138, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1248951138} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 03:56:35,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In734154951 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In734154951 256)))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In734154951 256))) (= 0 (mod ~y$w_buff0_used~0_In734154951 256)) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In734154951 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite20_Out734154951| ~y$w_buff0_used~0_In734154951) .cse1 (= |P1Thread1of1ForFork1_#t~ite21_Out734154951| |P1Thread1of1ForFork1_#t~ite20_Out734154951|)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out734154951| ~y$w_buff0_used~0_In734154951) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In734154951| |P1Thread1of1ForFork1_#t~ite20_Out734154951|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In734154951, ~y$w_buff0_used~0=~y$w_buff0_used~0_In734154951, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In734154951|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In734154951, ~weak$$choice2~0=~weak$$choice2~0_In734154951, ~y$w_buff1_used~0=~y$w_buff1_used~0_In734154951} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In734154951, ~y$w_buff0_used~0=~y$w_buff0_used~0_In734154951, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out734154951|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In734154951, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out734154951|, ~weak$$choice2~0=~weak$$choice2~0_In734154951, ~y$w_buff1_used~0=~y$w_buff1_used~0_In734154951} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 03:56:35,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In260688823 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In260688823 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite24_Out260688823| |P1Thread1of1ForFork1_#t~ite23_Out260688823|)) (.cse5 (= 0 (mod ~y$r_buff1_thd2~0_In260688823 256))) (.cse4 (= (mod ~y$w_buff0_used~0_In260688823 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In260688823 256) 0))) (or (and (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out260688823| ~y$w_buff1_used~0_In260688823) (= |P1Thread1of1ForFork1_#t~ite23_Out260688823| |P1Thread1of1ForFork1_#t~ite23_In260688823|) (not .cse0)) (and .cse0 .cse1 (or (and .cse2 .cse3) .cse4 (and .cse3 .cse5)) (= |P1Thread1of1ForFork1_#t~ite23_Out260688823| ~y$w_buff1_used~0_In260688823))) (= |P1Thread1of1ForFork1_#t~ite22_In260688823| |P1Thread1of1ForFork1_#t~ite22_Out260688823|)) (let ((.cse6 (not .cse3))) (and .cse0 (or (not .cse2) .cse6) .cse1 (or (not .cse5) .cse6) (not .cse4) (= |P1Thread1of1ForFork1_#t~ite23_Out260688823| |P1Thread1of1ForFork1_#t~ite22_Out260688823|) (= |P1Thread1of1ForFork1_#t~ite22_Out260688823| 0))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In260688823, ~y$w_buff0_used~0=~y$w_buff0_used~0_In260688823, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In260688823, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In260688823|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In260688823|, ~weak$$choice2~0=~weak$$choice2~0_In260688823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In260688823} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In260688823, ~y$w_buff0_used~0=~y$w_buff0_used~0_In260688823, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In260688823, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out260688823|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out260688823|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out260688823|, ~weak$$choice2~0=~weak$$choice2~0_In260688823, ~y$w_buff1_used~0=~y$w_buff1_used~0_In260688823} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 03:56:35,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In185459277 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In185459277 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In185459277 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In185459277 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out185459277|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In185459277 |P0Thread1of1ForFork0_#t~ite6_Out185459277|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In185459277, ~y$w_buff0_used~0=~y$w_buff0_used~0_In185459277, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In185459277, ~y$w_buff1_used~0=~y$w_buff1_used~0_In185459277} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out185459277|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In185459277, ~y$w_buff0_used~0=~y$w_buff0_used~0_In185459277, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In185459277, ~y$w_buff1_used~0=~y$w_buff1_used~0_In185459277} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 03:56:35,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-164967930 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-164967930 256) 0))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out-164967930) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In-164967930 ~y$r_buff0_thd1~0_Out-164967930) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-164967930, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-164967930} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-164967930, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-164967930|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-164967930} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 03:56:35,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1790735585 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1790735585 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1790735585 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1790735585 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1790735585| ~y$r_buff1_thd1~0_In1790735585) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1790735585| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1790735585, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1790735585, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1790735585, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1790735585} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1790735585, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1790735585, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1790735585|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1790735585, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1790735585} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 03:56:35,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 03:56:35,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In741824671 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out741824671| |P1Thread1of1ForFork1_#t~ite29_Out741824671|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In741824671 256)))) (or (= (mod ~y$w_buff0_used~0_In741824671 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In741824671 256)) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In741824671 256) 0) .cse1))) (= ~y$r_buff1_thd2~0_In741824671 |P1Thread1of1ForFork1_#t~ite29_Out741824671|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out741824671| ~y$r_buff1_thd2~0_In741824671) (= |P1Thread1of1ForFork1_#t~ite29_In741824671| |P1Thread1of1ForFork1_#t~ite29_Out741824671|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In741824671, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In741824671|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In741824671, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In741824671, ~weak$$choice2~0=~weak$$choice2~0_In741824671, ~y$w_buff1_used~0=~y$w_buff1_used~0_In741824671} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In741824671, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out741824671|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out741824671|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In741824671, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In741824671, ~weak$$choice2~0=~weak$$choice2~0_In741824671, ~y$w_buff1_used~0=~y$w_buff1_used~0_In741824671} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 03:56:35,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 03:56:35,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-559291020 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-559291020 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In-559291020 |P1Thread1of1ForFork1_#t~ite32_Out-559291020|) (not .cse1)) (and (= ~y~0_In-559291020 |P1Thread1of1ForFork1_#t~ite32_Out-559291020|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-559291020, ~y$w_buff1~0=~y$w_buff1~0_In-559291020, ~y~0=~y~0_In-559291020, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-559291020} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-559291020, ~y$w_buff1~0=~y$w_buff1~0_In-559291020, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-559291020|, ~y~0=~y~0_In-559291020, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-559291020} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 03:56:35,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 03:56:35,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1186536247 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1186536247 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-1186536247| 0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1186536247 |P1Thread1of1ForFork1_#t~ite34_Out-1186536247|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1186536247, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1186536247} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1186536247, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1186536247, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1186536247|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 03:56:35,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1228467791 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1228467791 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1228467791 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1228467791 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1228467791|)) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-1228467791 |P1Thread1of1ForFork1_#t~ite35_Out-1228467791|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1228467791, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1228467791, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1228467791, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1228467791} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1228467791, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1228467791, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1228467791, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1228467791|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1228467791} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 03:56:35,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1450320905 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1450320905 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1450320905| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1450320905| ~y$r_buff0_thd2~0_In-1450320905) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1450320905, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1450320905} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1450320905, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1450320905, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1450320905|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 03:56:35,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In-283980802 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-283980802 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-283980802 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-283980802 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-283980802|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In-283980802 |P1Thread1of1ForFork1_#t~ite37_Out-283980802|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-283980802, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-283980802, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-283980802, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-283980802} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-283980802, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-283980802, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-283980802, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-283980802|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-283980802} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 03:56:35,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 03:56:35,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 03:56:35,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 03:56:35,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1988970366 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1988970366 256) 0))) (or (and (= ~y~0_In-1988970366 |ULTIMATE.start_main_#t~ite40_Out-1988970366|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1988970366| ~y$w_buff1~0_In-1988970366)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1988970366, ~y~0=~y~0_In-1988970366, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1988970366, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1988970366} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1988970366|, ~y$w_buff1~0=~y$w_buff1~0_In-1988970366, ~y~0=~y~0_In-1988970366, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1988970366, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1988970366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 03:56:35,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 03:56:35,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In946981478 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In946981478 256)))) (or (and (= ~y$w_buff0_used~0_In946981478 |ULTIMATE.start_main_#t~ite42_Out946981478|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out946981478| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In946981478, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In946981478} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In946981478, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In946981478, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out946981478|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 03:56:35,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1102036907 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1102036907 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1102036907 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1102036907 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1102036907 |ULTIMATE.start_main_#t~ite43_Out-1102036907|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1102036907|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1102036907, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1102036907, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1102036907, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1102036907} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1102036907, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1102036907, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1102036907|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1102036907, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1102036907} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 03:56:35,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1220477640 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1220477640 256)))) (or (and (= ~y$r_buff0_thd0~0_In-1220477640 |ULTIMATE.start_main_#t~ite44_Out-1220477640|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1220477640|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1220477640, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1220477640} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1220477640, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1220477640, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1220477640|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 03:56:35,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In2129356834 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2129356834 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In2129356834 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In2129356834 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out2129356834| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out2129356834| ~y$r_buff1_thd0~0_In2129356834) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2129356834, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2129356834, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2129356834, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2129356834} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2129356834, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2129356834, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2129356834, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2129356834|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2129356834} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 03:56:35,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_~__unbuffered_p1_EBX~0_17 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 1 v_~__unbuffered_p1_EAX~0_21)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 03:56:35,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:56:35 BasicIcfg [2019-12-27 03:56:35,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:56:35,294 INFO L168 Benchmark]: Toolchain (without parser) took 14587.16 ms. Allocated memory was 136.8 MB in the beginning and 618.1 MB in the end (delta: 481.3 MB). Free memory was 100.9 MB in the beginning and 454.9 MB in the end (delta: -353.9 MB). Peak memory consumption was 127.4 MB. Max. memory is 7.1 GB. [2019-12-27 03:56:35,295 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 03:56:35,296 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.13 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 155.7 MB in the end (delta: -55.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-12-27 03:56:35,297 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.62 ms. Allocated memory is still 201.3 MB. Free memory was 155.7 MB in the beginning and 152.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:56:35,297 INFO L168 Benchmark]: Boogie Preprocessor took 34.35 ms. Allocated memory is still 201.3 MB. Free memory was 152.9 MB in the beginning and 150.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 03:56:35,298 INFO L168 Benchmark]: RCFGBuilder took 738.69 ms. Allocated memory is still 201.3 MB. Free memory was 150.8 MB in the beginning and 106.2 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:56:35,302 INFO L168 Benchmark]: TraceAbstraction took 12986.61 ms. Allocated memory was 201.3 MB in the beginning and 618.1 MB in the end (delta: 416.8 MB). Free memory was 106.2 MB in the beginning and 454.9 MB in the end (delta: -348.7 MB). Peak memory consumption was 68.1 MB. Max. memory is 7.1 GB. [2019-12-27 03:56:35,308 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.44 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 754.13 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 100.5 MB in the beginning and 155.7 MB in the end (delta: -55.2 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.62 ms. Allocated memory is still 201.3 MB. Free memory was 155.7 MB in the beginning and 152.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.35 ms. Allocated memory is still 201.3 MB. Free memory was 152.9 MB in the beginning and 150.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 738.69 ms. Allocated memory is still 201.3 MB. Free memory was 150.8 MB in the beginning and 106.2 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12986.61 ms. Allocated memory was 201.3 MB in the beginning and 618.1 MB in the end (delta: 416.8 MB). Free memory was 106.2 MB in the beginning and 454.9 MB in the end (delta: -348.7 MB). Peak memory consumption was 68.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4569 VarBasedMoverChecksPositive, 175 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 211 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t2315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t2316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1459 SDtfs, 1573 SDslu, 2642 SDs, 0 SdLazy, 1477 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 5169 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 347 ConstructedInterpolants, 0 QuantifiedInterpolants, 37039 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...