/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:23:56,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:23:56,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:23:56,423 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:23:56,423 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:23:56,424 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:23:56,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:23:56,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:23:56,429 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:23:56,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:23:56,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:23:56,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:23:56,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:23:56,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:23:56,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:23:56,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:23:56,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:23:56,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:23:56,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:23:56,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:23:56,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:23:56,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:23:56,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:23:56,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:23:56,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:23:56,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:23:56,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:23:56,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:23:56,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:23:56,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:23:56,453 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:23:56,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:23:56,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:23:56,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:23:56,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:23:56,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:23:56,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:23:56,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:23:56,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:23:56,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:23:56,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:23:56,460 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:23:56,474 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:23:56,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:23:56,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:23:56,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:23:56,476 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:23:56,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:23:56,476 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:23:56,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:23:56,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:23:56,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:23:56,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:23:56,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:23:56,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:23:56,478 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:23:56,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:23:56,478 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:23:56,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:23:56,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:23:56,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:23:56,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:23:56,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:23:56,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:23:56,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:23:56,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:23:56,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:23:56,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:23:56,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:23:56,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:23:56,481 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:23:56,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:23:56,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:23:56,788 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:23:56,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:23:56,793 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:23:56,793 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:23:56,794 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_pso.opt.i [2019-12-26 22:23:56,858 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2862e326/5cbe3691d4084d0088dddad003a2392f/FLAGb7b8515f4 [2019-12-26 22:23:57,381 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:23:57,382 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_pso.opt.i [2019-12-26 22:23:57,404 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2862e326/5cbe3691d4084d0088dddad003a2392f/FLAGb7b8515f4 [2019-12-26 22:23:57,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2862e326/5cbe3691d4084d0088dddad003a2392f [2019-12-26 22:23:57,700 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:23:57,702 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:23:57,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:23:57,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:23:57,707 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:23:57,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:23:57" (1/1) ... [2019-12-26 22:23:57,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e7f0ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:57, skipping insertion in model container [2019-12-26 22:23:57,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:23:57" (1/1) ... [2019-12-26 22:23:57,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:23:57,792 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:23:58,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:23:58,319 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:23:58,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:23:58,512 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:23:58,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:58 WrapperNode [2019-12-26 22:23:58,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:23:58,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:23:58,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:23:58,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:23:58,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:58" (1/1) ... [2019-12-26 22:23:58,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:58" (1/1) ... [2019-12-26 22:23:58,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:23:58,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:23:58,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:23:58,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:23:58,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:58" (1/1) ... [2019-12-26 22:23:58,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:58" (1/1) ... [2019-12-26 22:23:58,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:58" (1/1) ... [2019-12-26 22:23:58,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:58" (1/1) ... [2019-12-26 22:23:58,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:58" (1/1) ... [2019-12-26 22:23:58,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:58" (1/1) ... [2019-12-26 22:23:58,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:58" (1/1) ... [2019-12-26 22:23:58,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:23:58,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:23:58,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:23:58,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:23:58,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:58" (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-26 22:23:58,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:23:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:23:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:23:58,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:23:58,704 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:23:58,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:23:58,704 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:23:58,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:23:58,706 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:23:58,706 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:23:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 22:23:58,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 22:23:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:23:58,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:23:58,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:23:58,710 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:23:59,456 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:23:59,457 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:23:59,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:23:59 BoogieIcfgContainer [2019-12-26 22:23:59,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:23:59,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:23:59,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:23:59,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:23:59,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:23:57" (1/3) ... [2019-12-26 22:23:59,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9f2afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:23:59, skipping insertion in model container [2019-12-26 22:23:59,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:23:58" (2/3) ... [2019-12-26 22:23:59,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9f2afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:23:59, skipping insertion in model container [2019-12-26 22:23:59,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:23:59" (3/3) ... [2019-12-26 22:23:59,471 INFO L109 eAbstractionObserver]: Analyzing ICFG mix036_pso.opt.i [2019-12-26 22:23:59,481 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:23:59,482 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:23:59,491 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:23:59,491 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:23:59,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,533 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,533 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,534 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,535 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,537 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,537 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,552 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,553 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,554 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,555 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,556 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,561 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,561 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,561 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,561 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,562 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,562 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,562 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,562 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,563 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,563 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,563 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,563 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,564 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,565 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,589 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,589 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,594 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,595 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,600 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,600 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,600 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,600 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,601 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,601 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,601 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,601 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,601 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,601 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,602 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,602 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,604 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,605 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:23:59,620 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 22:23:59,641 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:23:59,642 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:23:59,642 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:23:59,642 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:23:59,642 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:23:59,642 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:23:59,642 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:23:59,643 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:23:59,668 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 193 transitions [2019-12-26 22:23:59,670 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 171 places, 193 transitions [2019-12-26 22:23:59,777 INFO L132 PetriNetUnfolder]: 35/189 cut-off events. [2019-12-26 22:23:59,778 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:23:59,793 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 189 events. 35/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 355 event pairs. 0/152 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-26 22:23:59,815 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 171 places, 193 transitions [2019-12-26 22:23:59,866 INFO L132 PetriNetUnfolder]: 35/189 cut-off events. [2019-12-26 22:23:59,867 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:23:59,873 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 189 events. 35/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 355 event pairs. 0/152 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-26 22:23:59,888 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-26 22:23:59,890 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:24:04,509 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-12-26 22:24:05,121 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-26 22:24:05,282 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-26 22:24:05,331 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48496 [2019-12-26 22:24:05,331 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-26 22:24:05,334 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 87 transitions [2019-12-26 22:24:06,856 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 26302 states. [2019-12-26 22:24:06,858 INFO L276 IsEmpty]: Start isEmpty. Operand 26302 states. [2019-12-26 22:24:06,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 22:24:06,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:06,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:24:06,866 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:06,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:06,871 INFO L82 PathProgramCache]: Analyzing trace with hash -887935004, now seen corresponding path program 1 times [2019-12-26 22:24:06,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:06,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132611686] [2019-12-26 22:24:06,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:07,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:24:07,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132611686] [2019-12-26 22:24:07,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:07,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:24:07,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038248081] [2019-12-26 22:24:07,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:24:07,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:07,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:24:07,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:24:07,219 INFO L87 Difference]: Start difference. First operand 26302 states. Second operand 3 states. [2019-12-26 22:24:07,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:07,896 INFO L93 Difference]: Finished difference Result 25630 states and 112008 transitions. [2019-12-26 22:24:07,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:24:07,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-26 22:24:07,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:09,141 INFO L225 Difference]: With dead ends: 25630 [2019-12-26 22:24:09,141 INFO L226 Difference]: Without dead ends: 24142 [2019-12-26 22:24:09,143 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-26 22:24:09,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24142 states. [2019-12-26 22:24:10,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24142 to 24142. [2019-12-26 22:24:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24142 states. [2019-12-26 22:24:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24142 states to 24142 states and 105356 transitions. [2019-12-26 22:24:10,340 INFO L78 Accepts]: Start accepts. Automaton has 24142 states and 105356 transitions. Word has length 9 [2019-12-26 22:24:10,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:10,342 INFO L462 AbstractCegarLoop]: Abstraction has 24142 states and 105356 transitions. [2019-12-26 22:24:10,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:24:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 24142 states and 105356 transitions. [2019-12-26 22:24:10,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:24:10,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:10,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:24:10,352 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:10,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:10,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1247749362, now seen corresponding path program 1 times [2019-12-26 22:24:10,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:10,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970616815] [2019-12-26 22:24:10,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:10,457 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-26 22:24:10,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970616815] [2019-12-26 22:24:10,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:10,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:24:10,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404000231] [2019-12-26 22:24:10,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:24:10,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:10,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:24:10,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:24:10,462 INFO L87 Difference]: Start difference. First operand 24142 states and 105356 transitions. Second operand 3 states. [2019-12-26 22:24:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:10,798 INFO L93 Difference]: Finished difference Result 19320 states and 78413 transitions. [2019-12-26 22:24:10,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:24:10,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 22:24:10,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:10,887 INFO L225 Difference]: With dead ends: 19320 [2019-12-26 22:24:10,888 INFO L226 Difference]: Without dead ends: 19320 [2019-12-26 22:24:10,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:24:11,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19320 states. [2019-12-26 22:24:12,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19320 to 19320. [2019-12-26 22:24:12,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19320 states. [2019-12-26 22:24:12,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19320 states to 19320 states and 78413 transitions. [2019-12-26 22:24:12,788 INFO L78 Accepts]: Start accepts. Automaton has 19320 states and 78413 transitions. Word has length 15 [2019-12-26 22:24:12,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:12,788 INFO L462 AbstractCegarLoop]: Abstraction has 19320 states and 78413 transitions. [2019-12-26 22:24:12,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:24:12,788 INFO L276 IsEmpty]: Start isEmpty. Operand 19320 states and 78413 transitions. [2019-12-26 22:24:12,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:24:12,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:12,792 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:24:12,792 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:12,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:12,792 INFO L82 PathProgramCache]: Analyzing trace with hash -321510213, now seen corresponding path program 1 times [2019-12-26 22:24:12,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:12,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379284253] [2019-12-26 22:24:12,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:12,890 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-26 22:24:12,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379284253] [2019-12-26 22:24:12,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:12,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:24:12,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517008682] [2019-12-26 22:24:12,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:24:12,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:12,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:24:12,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:24:12,892 INFO L87 Difference]: Start difference. First operand 19320 states and 78413 transitions. Second operand 4 states. [2019-12-26 22:24:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:12,978 INFO L93 Difference]: Finished difference Result 8957 states and 30876 transitions. [2019-12-26 22:24:12,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:24:12,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:24:12,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:13,008 INFO L225 Difference]: With dead ends: 8957 [2019-12-26 22:24:13,008 INFO L226 Difference]: Without dead ends: 8957 [2019-12-26 22:24:13,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:24:13,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8957 states. [2019-12-26 22:24:13,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8957 to 8957. [2019-12-26 22:24:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8957 states. [2019-12-26 22:24:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8957 states to 8957 states and 30876 transitions. [2019-12-26 22:24:13,258 INFO L78 Accepts]: Start accepts. Automaton has 8957 states and 30876 transitions. Word has length 16 [2019-12-26 22:24:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:13,258 INFO L462 AbstractCegarLoop]: Abstraction has 8957 states and 30876 transitions. [2019-12-26 22:24:13,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:24:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 8957 states and 30876 transitions. [2019-12-26 22:24:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 22:24:13,260 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:13,261 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:24:13,261 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:13,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:13,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1192067329, now seen corresponding path program 1 times [2019-12-26 22:24:13,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:13,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672199318] [2019-12-26 22:24:13,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:13,337 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-26 22:24:13,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672199318] [2019-12-26 22:24:13,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:13,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:24:13,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266937099] [2019-12-26 22:24:13,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:24:13,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:13,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:24:13,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:24:13,339 INFO L87 Difference]: Start difference. First operand 8957 states and 30876 transitions. Second operand 5 states. [2019-12-26 22:24:13,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:13,593 INFO L93 Difference]: Finished difference Result 2671 states and 8332 transitions. [2019-12-26 22:24:13,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:24:13,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-26 22:24:13,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:13,604 INFO L225 Difference]: With dead ends: 2671 [2019-12-26 22:24:13,604 INFO L226 Difference]: Without dead ends: 2671 [2019-12-26 22:24:13,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:24:13,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2019-12-26 22:24:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 2671. [2019-12-26 22:24:13,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2671 states. [2019-12-26 22:24:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 8332 transitions. [2019-12-26 22:24:13,664 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 8332 transitions. Word has length 17 [2019-12-26 22:24:13,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:13,667 INFO L462 AbstractCegarLoop]: Abstraction has 2671 states and 8332 transitions. [2019-12-26 22:24:13,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:24:13,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 8332 transitions. [2019-12-26 22:24:13,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 22:24:13,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:13,669 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-26 22:24:13,669 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:13,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:13,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1635073164, now seen corresponding path program 1 times [2019-12-26 22:24:13,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:13,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008146543] [2019-12-26 22:24:13,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:13,727 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-26 22:24:13,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008146543] [2019-12-26 22:24:13,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:13,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:24:13,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884327415] [2019-12-26 22:24:13,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:24:13,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:13,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:24:13,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:24:13,730 INFO L87 Difference]: Start difference. First operand 2671 states and 8332 transitions. Second operand 3 states. [2019-12-26 22:24:13,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:13,804 INFO L93 Difference]: Finished difference Result 3677 states and 11111 transitions. [2019-12-26 22:24:13,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:24:13,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-26 22:24:13,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:13,816 INFO L225 Difference]: With dead ends: 3677 [2019-12-26 22:24:13,816 INFO L226 Difference]: Without dead ends: 3677 [2019-12-26 22:24:13,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:24:13,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2019-12-26 22:24:13,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 2975. [2019-12-26 22:24:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2975 states. [2019-12-26 22:24:13,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 9196 transitions. [2019-12-26 22:24:13,905 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 9196 transitions. Word has length 18 [2019-12-26 22:24:13,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:13,905 INFO L462 AbstractCegarLoop]: Abstraction has 2975 states and 9196 transitions. [2019-12-26 22:24:13,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:24:13,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 9196 transitions. [2019-12-26 22:24:13,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 22:24:13,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:13,908 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-26 22:24:13,908 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:13,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:13,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1634952543, now seen corresponding path program 1 times [2019-12-26 22:24:13,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:13,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985814876] [2019-12-26 22:24:13,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:13,972 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-26 22:24:13,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985814876] [2019-12-26 22:24:13,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:13,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:24:13,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420291071] [2019-12-26 22:24:13,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:24:13,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:13,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:24:13,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:24:13,974 INFO L87 Difference]: Start difference. First operand 2975 states and 9196 transitions. Second operand 4 states. [2019-12-26 22:24:14,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:14,123 INFO L93 Difference]: Finished difference Result 3817 states and 11515 transitions. [2019-12-26 22:24:14,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:24:14,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-26 22:24:14,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:14,130 INFO L225 Difference]: With dead ends: 3817 [2019-12-26 22:24:14,131 INFO L226 Difference]: Without dead ends: 3817 [2019-12-26 22:24:14,131 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-26 22:24:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3817 states. [2019-12-26 22:24:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3817 to 3609. [2019-12-26 22:24:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3609 states. [2019-12-26 22:24:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3609 states and 11065 transitions. [2019-12-26 22:24:14,210 INFO L78 Accepts]: Start accepts. Automaton has 3609 states and 11065 transitions. Word has length 18 [2019-12-26 22:24:14,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:14,210 INFO L462 AbstractCegarLoop]: Abstraction has 3609 states and 11065 transitions. [2019-12-26 22:24:14,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:24:14,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 11065 transitions. [2019-12-26 22:24:14,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 22:24:14,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:14,213 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-26 22:24:14,213 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:14,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:14,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1770652005, now seen corresponding path program 1 times [2019-12-26 22:24:14,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:14,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720638174] [2019-12-26 22:24:14,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:14,267 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-26 22:24:14,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720638174] [2019-12-26 22:24:14,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:14,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:24:14,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557298005] [2019-12-26 22:24:14,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:24:14,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:14,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:24:14,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:24:14,269 INFO L87 Difference]: Start difference. First operand 3609 states and 11065 transitions. Second operand 4 states. [2019-12-26 22:24:14,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:14,431 INFO L93 Difference]: Finished difference Result 4536 states and 13681 transitions. [2019-12-26 22:24:14,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:24:14,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-26 22:24:14,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:14,440 INFO L225 Difference]: With dead ends: 4536 [2019-12-26 22:24:14,441 INFO L226 Difference]: Without dead ends: 4536 [2019-12-26 22:24:14,441 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-26 22:24:14,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2019-12-26 22:24:14,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 3800. [2019-12-26 22:24:14,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3800 states. [2019-12-26 22:24:14,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3800 states to 3800 states and 11664 transitions. [2019-12-26 22:24:14,532 INFO L78 Accepts]: Start accepts. Automaton has 3800 states and 11664 transitions. Word has length 18 [2019-12-26 22:24:14,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:14,532 INFO L462 AbstractCegarLoop]: Abstraction has 3800 states and 11664 transitions. [2019-12-26 22:24:14,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:24:14,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3800 states and 11664 transitions. [2019-12-26 22:24:14,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-26 22:24:14,548 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:14,549 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] [2019-12-26 22:24:14,549 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:14,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:14,550 INFO L82 PathProgramCache]: Analyzing trace with hash 808807491, now seen corresponding path program 1 times [2019-12-26 22:24:14,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:14,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981091065] [2019-12-26 22:24:14,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:14,683 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-26 22:24:14,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981091065] [2019-12-26 22:24:14,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:14,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:24:14,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520572103] [2019-12-26 22:24:14,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:24:14,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:14,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:24:14,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:24:14,686 INFO L87 Difference]: Start difference. First operand 3800 states and 11664 transitions. Second operand 6 states. [2019-12-26 22:24:14,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:14,782 INFO L93 Difference]: Finished difference Result 2862 states and 9250 transitions. [2019-12-26 22:24:14,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:24:14,783 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-26 22:24:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:14,792 INFO L225 Difference]: With dead ends: 2862 [2019-12-26 22:24:14,792 INFO L226 Difference]: Without dead ends: 2862 [2019-12-26 22:24:14,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:24:14,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-12-26 22:24:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2702. [2019-12-26 22:24:14,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2702 states. [2019-12-26 22:24:14,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 8770 transitions. [2019-12-26 22:24:14,864 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 8770 transitions. Word has length 32 [2019-12-26 22:24:14,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:14,866 INFO L462 AbstractCegarLoop]: Abstraction has 2702 states and 8770 transitions. [2019-12-26 22:24:14,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:24:14,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 8770 transitions. [2019-12-26 22:24:14,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 22:24:14,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:14,877 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] [2019-12-26 22:24:14,877 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:14,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:14,878 INFO L82 PathProgramCache]: Analyzing trace with hash -2084522499, now seen corresponding path program 1 times [2019-12-26 22:24:14,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:14,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166767483] [2019-12-26 22:24:14,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:14,982 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-26 22:24:14,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166767483] [2019-12-26 22:24:14,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:14,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:24:14,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969383195] [2019-12-26 22:24:14,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:24:14,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:14,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:24:14,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:24:14,984 INFO L87 Difference]: Start difference. First operand 2702 states and 8770 transitions. Second operand 6 states. [2019-12-26 22:24:15,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:15,234 INFO L93 Difference]: Finished difference Result 7070 states and 22784 transitions. [2019-12-26 22:24:15,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:24:15,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-26 22:24:15,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:15,247 INFO L225 Difference]: With dead ends: 7070 [2019-12-26 22:24:15,247 INFO L226 Difference]: Without dead ends: 4700 [2019-12-26 22:24:15,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:24:15,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4700 states. [2019-12-26 22:24:15,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4700 to 3034. [2019-12-26 22:24:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3034 states. [2019-12-26 22:24:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 9866 transitions. [2019-12-26 22:24:15,334 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 9866 transitions. Word has length 47 [2019-12-26 22:24:15,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:15,335 INFO L462 AbstractCegarLoop]: Abstraction has 3034 states and 9866 transitions. [2019-12-26 22:24:15,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:24:15,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 9866 transitions. [2019-12-26 22:24:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 22:24:15,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:15,344 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] [2019-12-26 22:24:15,344 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:15,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:15,345 INFO L82 PathProgramCache]: Analyzing trace with hash 797062781, now seen corresponding path program 2 times [2019-12-26 22:24:15,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:15,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891964732] [2019-12-26 22:24:15,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:15,611 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-26 22:24:15,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891964732] [2019-12-26 22:24:15,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:15,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:24:15,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529765001] [2019-12-26 22:24:15,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:24:15,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:15,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:24:15,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:24:15,614 INFO L87 Difference]: Start difference. First operand 3034 states and 9866 transitions. Second operand 4 states. [2019-12-26 22:24:15,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:15,649 INFO L93 Difference]: Finished difference Result 4244 states and 13199 transitions. [2019-12-26 22:24:15,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:24:15,650 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-26 22:24:15,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:15,655 INFO L225 Difference]: With dead ends: 4244 [2019-12-26 22:24:15,655 INFO L226 Difference]: Without dead ends: 2716 [2019-12-26 22:24:15,656 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-26 22:24:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2019-12-26 22:24:15,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716. [2019-12-26 22:24:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2019-12-26 22:24:15,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 8680 transitions. [2019-12-26 22:24:15,707 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 8680 transitions. Word has length 47 [2019-12-26 22:24:15,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:15,708 INFO L462 AbstractCegarLoop]: Abstraction has 2716 states and 8680 transitions. [2019-12-26 22:24:15,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:24:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 8680 transitions. [2019-12-26 22:24:15,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 22:24:15,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:15,717 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] [2019-12-26 22:24:15,717 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:15,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:15,717 INFO L82 PathProgramCache]: Analyzing trace with hash -699186775, now seen corresponding path program 3 times [2019-12-26 22:24:15,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:15,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106927395] [2019-12-26 22:24:15,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:15,788 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-26 22:24:15,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106927395] [2019-12-26 22:24:15,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:15,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:24:15,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608432434] [2019-12-26 22:24:15,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:24:15,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:15,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:24:15,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:24:15,790 INFO L87 Difference]: Start difference. First operand 2716 states and 8680 transitions. Second operand 4 states. [2019-12-26 22:24:15,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:15,821 INFO L93 Difference]: Finished difference Result 3334 states and 10072 transitions. [2019-12-26 22:24:15,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:24:15,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-26 22:24:15,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:15,826 INFO L225 Difference]: With dead ends: 3334 [2019-12-26 22:24:15,826 INFO L226 Difference]: Without dead ends: 1966 [2019-12-26 22:24:15,826 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-26 22:24:15,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2019-12-26 22:24:15,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1966. [2019-12-26 22:24:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2019-12-26 22:24:15,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 5635 transitions. [2019-12-26 22:24:15,860 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 5635 transitions. Word has length 47 [2019-12-26 22:24:15,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:15,860 INFO L462 AbstractCegarLoop]: Abstraction has 1966 states and 5635 transitions. [2019-12-26 22:24:15,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:24:15,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 5635 transitions. [2019-12-26 22:24:15,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 22:24:15,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:15,866 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] [2019-12-26 22:24:15,866 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:15,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:15,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1157951545, now seen corresponding path program 4 times [2019-12-26 22:24:15,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:15,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738181610] [2019-12-26 22:24:15,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:15,927 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-26 22:24:15,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738181610] [2019-12-26 22:24:15,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:15,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:24:15,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798911768] [2019-12-26 22:24:15,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:24:15,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:15,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:24:15,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:24:15,929 INFO L87 Difference]: Start difference. First operand 1966 states and 5635 transitions. Second operand 4 states. [2019-12-26 22:24:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:15,952 INFO L93 Difference]: Finished difference Result 2394 states and 6598 transitions. [2019-12-26 22:24:15,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:24:15,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-26 22:24:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:15,954 INFO L225 Difference]: With dead ends: 2394 [2019-12-26 22:24:15,954 INFO L226 Difference]: Without dead ends: 476 [2019-12-26 22:24:15,954 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-26 22:24:15,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-12-26 22:24:15,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2019-12-26 22:24:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-12-26 22:24:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1048 transitions. [2019-12-26 22:24:15,961 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1048 transitions. Word has length 47 [2019-12-26 22:24:15,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:15,961 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 1048 transitions. [2019-12-26 22:24:15,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:24:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1048 transitions. [2019-12-26 22:24:15,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 22:24:15,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:15,963 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] [2019-12-26 22:24:15,963 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:15,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:15,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1554022263, now seen corresponding path program 5 times [2019-12-26 22:24:15,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:15,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471330491] [2019-12-26 22:24:15,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:16,038 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-26 22:24:16,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471330491] [2019-12-26 22:24:16,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:16,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:24:16,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368548224] [2019-12-26 22:24:16,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:24:16,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:16,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:24:16,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:24:16,040 INFO L87 Difference]: Start difference. First operand 476 states and 1048 transitions. Second operand 7 states. [2019-12-26 22:24:16,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:16,259 INFO L93 Difference]: Finished difference Result 848 states and 1836 transitions. [2019-12-26 22:24:16,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:24:16,260 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-26 22:24:16,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:16,261 INFO L225 Difference]: With dead ends: 848 [2019-12-26 22:24:16,261 INFO L226 Difference]: Without dead ends: 568 [2019-12-26 22:24:16,262 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-26 22:24:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-12-26 22:24:16,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 508. [2019-12-26 22:24:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-12-26 22:24:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1108 transitions. [2019-12-26 22:24:16,272 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1108 transitions. Word has length 47 [2019-12-26 22:24:16,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:16,273 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 1108 transitions. [2019-12-26 22:24:16,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:24:16,273 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1108 transitions. [2019-12-26 22:24:16,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 22:24:16,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:16,276 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] [2019-12-26 22:24:16,276 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:16,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:16,276 INFO L82 PathProgramCache]: Analyzing trace with hash 768924829, now seen corresponding path program 6 times [2019-12-26 22:24:16,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:16,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534429538] [2019-12-26 22:24:16,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:16,511 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-26 22:24:16,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534429538] [2019-12-26 22:24:16,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:16,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:24:16,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117766723] [2019-12-26 22:24:16,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:24:16,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:16,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:24:16,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:24:16,513 INFO L87 Difference]: Start difference. First operand 508 states and 1108 transitions. Second operand 8 states. [2019-12-26 22:24:16,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:16,966 INFO L93 Difference]: Finished difference Result 728 states and 1468 transitions. [2019-12-26 22:24:16,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 22:24:16,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-12-26 22:24:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:16,968 INFO L225 Difference]: With dead ends: 728 [2019-12-26 22:24:16,968 INFO L226 Difference]: Without dead ends: 704 [2019-12-26 22:24:16,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:24:16,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-12-26 22:24:16,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 577. [2019-12-26 22:24:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-12-26 22:24:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1199 transitions. [2019-12-26 22:24:16,978 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1199 transitions. Word has length 47 [2019-12-26 22:24:16,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:16,978 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 1199 transitions. [2019-12-26 22:24:16,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:24:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1199 transitions. [2019-12-26 22:24:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 22:24:16,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:16,980 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] [2019-12-26 22:24:16,981 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:16,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:16,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1543063203, now seen corresponding path program 1 times [2019-12-26 22:24:16,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:16,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905165738] [2019-12-26 22:24:16,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:17,035 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-26 22:24:17,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905165738] [2019-12-26 22:24:17,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:17,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:24:17,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77078524] [2019-12-26 22:24:17,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:24:17,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:17,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:24:17,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:24:17,038 INFO L87 Difference]: Start difference. First operand 577 states and 1199 transitions. Second operand 3 states. [2019-12-26 22:24:17,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:17,072 INFO L93 Difference]: Finished difference Result 644 states and 1250 transitions. [2019-12-26 22:24:17,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:24:17,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-26 22:24:17,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:17,074 INFO L225 Difference]: With dead ends: 644 [2019-12-26 22:24:17,074 INFO L226 Difference]: Without dead ends: 644 [2019-12-26 22:24:17,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:24:17,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-12-26 22:24:17,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 564. [2019-12-26 22:24:17,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-12-26 22:24:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1108 transitions. [2019-12-26 22:24:17,084 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1108 transitions. Word has length 47 [2019-12-26 22:24:17,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:17,084 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 1108 transitions. [2019-12-26 22:24:17,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:24:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1108 transitions. [2019-12-26 22:24:17,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 22:24:17,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:17,087 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] [2019-12-26 22:24:17,088 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:17,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:17,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2061863151, now seen corresponding path program 7 times [2019-12-26 22:24:17,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:17,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669859055] [2019-12-26 22:24:17,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:17,201 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-26 22:24:17,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669859055] [2019-12-26 22:24:17,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:17,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:24:17,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827139027] [2019-12-26 22:24:17,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:24:17,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:17,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:24:17,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:24:17,205 INFO L87 Difference]: Start difference. First operand 564 states and 1108 transitions. Second operand 6 states. [2019-12-26 22:24:17,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:17,625 INFO L93 Difference]: Finished difference Result 819 states and 1597 transitions. [2019-12-26 22:24:17,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:24:17,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-26 22:24:17,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:17,628 INFO L225 Difference]: With dead ends: 819 [2019-12-26 22:24:17,628 INFO L226 Difference]: Without dead ends: 819 [2019-12-26 22:24:17,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-26 22:24:17,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-12-26 22:24:17,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 588. [2019-12-26 22:24:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-12-26 22:24:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1161 transitions. [2019-12-26 22:24:17,636 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1161 transitions. Word has length 47 [2019-12-26 22:24:17,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:17,636 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 1161 transitions. [2019-12-26 22:24:17,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:24:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1161 transitions. [2019-12-26 22:24:17,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-26 22:24:17,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:17,638 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] [2019-12-26 22:24:17,638 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:17,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:17,639 INFO L82 PathProgramCache]: Analyzing trace with hash 98708811, now seen corresponding path program 8 times [2019-12-26 22:24:17,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:17,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088576563] [2019-12-26 22:24:17,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:24:17,699 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-26 22:24:17,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088576563] [2019-12-26 22:24:17,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:24:17,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:24:17,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20240218] [2019-12-26 22:24:17,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:24:17,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:24:17,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:24:17,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:24:17,701 INFO L87 Difference]: Start difference. First operand 588 states and 1161 transitions. Second operand 3 states. [2019-12-26 22:24:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:24:17,713 INFO L93 Difference]: Finished difference Result 586 states and 1156 transitions. [2019-12-26 22:24:17,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:24:17,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-26 22:24:17,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:24:17,715 INFO L225 Difference]: With dead ends: 586 [2019-12-26 22:24:17,715 INFO L226 Difference]: Without dead ends: 586 [2019-12-26 22:24:17,715 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-26 22:24:17,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-12-26 22:24:17,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 494. [2019-12-26 22:24:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-12-26 22:24:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 983 transitions. [2019-12-26 22:24:17,723 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 983 transitions. Word has length 47 [2019-12-26 22:24:17,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:24:17,723 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 983 transitions. [2019-12-26 22:24:17,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:24:17,723 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 983 transitions. [2019-12-26 22:24:17,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-26 22:24:17,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:24:17,725 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] [2019-12-26 22:24:17,725 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:24:17,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:24:17,725 INFO L82 PathProgramCache]: Analyzing trace with hash 477153033, now seen corresponding path program 1 times [2019-12-26 22:24:17,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:24:17,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109141685] [2019-12-26 22:24:17,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:24:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:24:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:24:17,876 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:24:17,877 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:24:17,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_99| 0 0))) (and (< 0 |v_#StackHeapBarrier_23|) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~z$r_buff0_thd3~0_325) (= 0 v_~z$r_buff0_thd4~0_238) (= v_~weak$$choice2~0_127 0) (= 0 v_~__unbuffered_p0_EAX~0_49) (= 0 |v_ULTIMATE.start_main_~#t949~0.offset_29|) (= v_~z$w_buff0~0_307 0) (= v_~__unbuffered_p3_EAX~0_136 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= 0 v_~__unbuffered_p3_EBX~0_136) (= |v_#valid_97| (store .cse0 |v_ULTIMATE.start_main_~#t949~0.base_44| 1)) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff1_thd0~0_179 0) (= 0 v_~z$r_buff1_thd4~0_175) (= v_~z$w_buff0_used~0_604 0) (= 0 |v_#NULL.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_~#t949~0.base_44|) 0) (= v_~z~0_135 0) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~weak$$choice0~0_20) (= v_~z$w_buff1~0_205 0) (= v_~z$r_buff1_thd1~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_119 0) (= v_~b~0_92 0) (= v_~z$r_buff0_thd2~0_73 0) (= v_~z$r_buff0_thd1~0_73 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t949~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t949~0.base_44|) |v_ULTIMATE.start_main_~#t949~0.offset_29| 0)) |v_#memory_int_29|) (= v_~a~0_119 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_37 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t949~0.base_44| 4)) (= v_~z$w_buff1_used~0_405 0) (= 0 v_~z$flush_delayed~0_40) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff1_thd3~0_260) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_31 0) (= v_~__unbuffered_cnt~0_126 0) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#t949~0.base_44|) (= v_~z$mem_tmp~0_21 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t950~0.base=|v_ULTIMATE.start_main_~#t950~0.base_39|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_119, #NULL.offset=|v_#NULL.offset_4|, ~a~0=v_~a~0_119, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ULTIMATE.start_main_~#t951~0.offset=|v_ULTIMATE.start_main_~#t951~0.offset_26|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_238, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_136, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ULTIMATE.start_main_~#t949~0.offset=|v_ULTIMATE.start_main_~#t949~0.offset_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ULTIMATE.start_main_~#t949~0.base=|v_ULTIMATE.start_main_~#t949~0.base_44|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_85|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_405, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_43|, ULTIMATE.start_main_~#t950~0.offset=|v_ULTIMATE.start_main_~#t950~0.offset_26|, ~z$flush_delayed~0=v_~z$flush_delayed~0_40, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_31|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_119, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_325, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_37, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_175, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_21|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t952~0.offset=|v_ULTIMATE.start_main_~#t952~0.offset_20|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_179, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_73, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_604, ~z$w_buff0~0=v_~z$w_buff0~0_307, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_260, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_59|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_~#t952~0.base=|v_ULTIMATE.start_main_~#t952~0.base_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_136, ULTIMATE.start_main_~#t951~0.base=|v_ULTIMATE.start_main_~#t951~0.base_39|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_63|, ~b~0=v_~b~0_92, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_127, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_73} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t950~0.base, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t951~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t949~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_~#t949~0.base, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t950~0.offset, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t952~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t952~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t951~0.base, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:24:17,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L845-1-->L847: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t950~0.base_12| 4)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t950~0.base_12|)) (= |v_ULTIMATE.start_main_~#t950~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t950~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t950~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t950~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t950~0.base_12|) |v_ULTIMATE.start_main_~#t950~0.offset_10| 1)) |v_#memory_int_17|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t950~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t950~0.base=|v_ULTIMATE.start_main_~#t950~0.base_12|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t950~0.offset=|v_ULTIMATE.start_main_~#t950~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t950~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t950~0.offset] because there is no mapped edge [2019-12-26 22:24:17,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L847-1-->L849: Formula: (and (= (store |v_#valid_55| |v_ULTIMATE.start_main_~#t951~0.base_13| 1) |v_#valid_54|) (= 0 (select |v_#valid_55| |v_ULTIMATE.start_main_~#t951~0.base_13|)) (= |v_ULTIMATE.start_main_~#t951~0.offset_11| 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t951~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t951~0.base_13|) |v_ULTIMATE.start_main_~#t951~0.offset_11| 2))) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t951~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t951~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t951~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t951~0.offset=|v_ULTIMATE.start_main_~#t951~0.offset_11|, #length=|v_#length_23|, ULTIMATE.start_main_~#t951~0.base=|v_ULTIMATE.start_main_~#t951~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t951~0.offset, #length, ULTIMATE.start_main_~#t951~0.base] because there is no mapped edge [2019-12-26 22:24:17,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L849-1-->L851: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t952~0.base_10| 4)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t952~0.base_10| 1) |v_#valid_46|) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t952~0.base_10|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t952~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t952~0.base_10|) |v_ULTIMATE.start_main_~#t952~0.offset_9| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t952~0.base_10|) (= |v_ULTIMATE.start_main_~#t952~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t952~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_4|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t952~0.base=|v_ULTIMATE.start_main_~#t952~0.base_10|, #length=|v_#length_17|, ULTIMATE.start_main_~#t952~0.offset=|v_ULTIMATE.start_main_~#t952~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t952~0.base, #length, ULTIMATE.start_main_~#t952~0.offset] because there is no mapped edge [2019-12-26 22:24:17,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L4-->L822: Formula: (and (= v_~z$r_buff0_thd4~0_24 v_~z$r_buff1_thd4~0_12) (= 1 v_~a~0_5) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_16 0)) (= v_~__unbuffered_p3_EBX~0_6 v_~b~0_6) (= v_~z$r_buff1_thd1~0_5 v_~z$r_buff0_thd1~0_6) (= v_~z$r_buff0_thd0~0_23 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff1_thd2~0_5 v_~z$r_buff0_thd2~0_6) (= v_~__unbuffered_p3_EAX~0_7 v_~a~0_5) (= v_~z$r_buff0_thd3~0_49 v_~z$r_buff1_thd3~0_27) (= v_~z$r_buff0_thd4~0_23 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_16, ~b~0=v_~b~0_6, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_6} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_16, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_12, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_6, ~a~0=v_~a~0_5, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, ~b~0=v_~b~0_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_5, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_7, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_23, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_6} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-26 22:24:17,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_112 (+ v_~__unbuffered_cnt~0_113 1)) (= v_P0Thread1of1ForFork3_~arg.base_22 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_27) (= v_~b~0_68 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_22) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_33} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ~b~0=v_~b~0_68, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_22, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_22, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-26 22:24:17,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_15 |v_P1Thread1of1ForFork0_#in~arg.base_15|) (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_19) (= 0 |v_P1Thread1of1ForFork0_#res.offset_9|) (= 0 |v_P1Thread1of1ForFork0_#res.base_9|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_15| v_P1Thread1of1ForFork0_~arg.offset_15) (= v_~x~0_30 1) (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1))) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_9|, ~y~0=v_~y~0_25, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_9|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-26 22:24:17,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L780-->L780-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-288280020 256)))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-288280020 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In-288280020 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In-288280020 256) 0) (and (= (mod ~z$r_buff1_thd3~0_In-288280020 256) 0) .cse0))) .cse1 (= |P2Thread1of1ForFork1_#t~ite8_Out-288280020| |P2Thread1of1ForFork1_#t~ite9_Out-288280020|) (= |P2Thread1of1ForFork1_#t~ite8_Out-288280020| ~z$w_buff0~0_In-288280020)) (and (= ~z$w_buff0~0_In-288280020 |P2Thread1of1ForFork1_#t~ite9_Out-288280020|) (= |P2Thread1of1ForFork1_#t~ite8_In-288280020| |P2Thread1of1ForFork1_#t~ite8_Out-288280020|) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-288280020, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-288280020, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-288280020, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-288280020, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-288280020, ~weak$$choice2~0=~weak$$choice2~0_In-288280020, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In-288280020|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-288280020, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-288280020, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-288280020, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-288280020, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-288280020, ~weak$$choice2~0=~weak$$choice2~0_In-288280020, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out-288280020|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out-288280020|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 22:24:17,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L784-->L785: Formula: (and (= v_~z$r_buff0_thd3~0_131 v_~z$r_buff0_thd3~0_130) (not (= (mod v_~weak$$choice2~0_38 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_12|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_8|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_38, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-26 22:24:17,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] L787-->L795: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_14 256))) (= 0 v_~z$flush_delayed~0_13) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= v_~z~0_40 v_~z$mem_tmp~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~z$flush_delayed~0=v_~z$flush_delayed~0_14} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 22:24:17,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-375753046 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-375753046 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-375753046 |P3Thread1of1ForFork2_#t~ite28_Out-375753046|)) (and (= 0 |P3Thread1of1ForFork2_#t~ite28_Out-375753046|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-375753046, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-375753046} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-375753046|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-375753046, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-375753046} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-26 22:24:17,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-465092337 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-465092337 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-465092337 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-465092337 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite29_Out-465092337| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P3Thread1of1ForFork2_#t~ite29_Out-465092337| ~z$w_buff1_used~0_In-465092337)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-465092337, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-465092337, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-465092337, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-465092337} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-465092337|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-465092337, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-465092337, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-465092337, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-465092337} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-26 22:24:17,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L825-->L826: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-148817053 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-148817053 256)))) (or (and (= ~z$r_buff0_thd4~0_Out-148817053 ~z$r_buff0_thd4~0_In-148817053) (or .cse0 .cse1)) (and (= 0 ~z$r_buff0_thd4~0_Out-148817053) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-148817053, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-148817053} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-148817053, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-148817053, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out-148817053|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-26 22:24:17,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L826-->L826-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In216264981 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In216264981 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In216264981 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In216264981 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite31_Out216264981| ~z$r_buff1_thd4~0_In216264981) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite31_Out216264981|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In216264981, ~z$w_buff0_used~0=~z$w_buff0_used~0_In216264981, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In216264981, ~z$w_buff1_used~0=~z$w_buff1_used~0_In216264981} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In216264981, ~z$w_buff0_used~0=~z$w_buff0_used~0_In216264981, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In216264981, ~z$w_buff1_used~0=~z$w_buff1_used~0_In216264981, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out216264981|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-26 22:24:17,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L826-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_44| v_~z$r_buff1_thd4~0_61) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_44|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_61, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_43|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-26 22:24:17,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L851-1-->L857: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 4 v_~__unbuffered_cnt~0_50)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:24:17,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L857-2-->L857-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1502620512 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1502620512 256)))) (or (and (= ~z~0_In1502620512 |ULTIMATE.start_main_#t~ite36_Out1502620512|) (or .cse0 .cse1)) (and (not .cse1) (= ~z$w_buff1~0_In1502620512 |ULTIMATE.start_main_#t~ite36_Out1502620512|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1502620512, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1502620512, ~z$w_buff1~0=~z$w_buff1~0_In1502620512, ~z~0=~z~0_In1502620512} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1502620512, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1502620512, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1502620512|, ~z$w_buff1~0=~z$w_buff1~0_In1502620512, ~z~0=~z~0_In1502620512} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-26 22:24:17,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L857-4-->L858: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite36_15|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_6|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-26 22:24:17,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In387150629 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In387150629 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out387150629|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In387150629 |ULTIMATE.start_main_#t~ite38_Out387150629|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In387150629, ~z$w_buff0_used~0=~z$w_buff0_used~0_In387150629} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In387150629, ~z$w_buff0_used~0=~z$w_buff0_used~0_In387150629, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out387150629|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-26 22:24:17,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L859-->L859-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2051583823 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-2051583823 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2051583823 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-2051583823 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out-2051583823| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-2051583823| ~z$w_buff1_used~0_In-2051583823) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2051583823, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2051583823, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2051583823, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2051583823} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2051583823, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2051583823|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2051583823, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2051583823, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2051583823} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-26 22:24:17,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L860-->L860-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1205990993 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1205990993 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1205990993| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1205990993| ~z$r_buff0_thd0~0_In1205990993)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1205990993, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1205990993} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1205990993, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1205990993|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1205990993} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-26 22:24:17,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L861-->L861-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In1812702185 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1812702185 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1812702185 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1812702185 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite41_Out1812702185|)) (and (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In1812702185 |ULTIMATE.start_main_#t~ite41_Out1812702185|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1812702185, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1812702185, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1812702185, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1812702185} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1812702185|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1812702185, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1812702185, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1812702185, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1812702185} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-26 22:24:17,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p3_EBX~0_117) (= v_~__unbuffered_p3_EAX~0_117 1) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_23 256)) (= 0 v_~__unbuffered_p2_EAX~0_31) (= v_~z$r_buff1_thd0~0_157 |v_ULTIMATE.start_main_#t~ite41_37|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~main$tmp_guard1~0_23 0) (= 0 v_~__unbuffered_p0_EAX~0_34) (= 0 v_~__unbuffered_p1_EAX~0_26)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_117} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_157, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_117, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:24:18,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:24:18 BasicIcfg [2019-12-26 22:24:18,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:24:18,006 INFO L168 Benchmark]: Toolchain (without parser) took 20304.51 ms. Allocated memory was 137.4 MB in the beginning and 1.0 GB in the end (delta: 876.1 MB). Free memory was 99.1 MB in the beginning and 240.6 MB in the end (delta: -141.5 MB). Peak memory consumption was 734.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:24:18,006 INFO L168 Benchmark]: CDTParser took 1.28 ms. Allocated memory is still 137.4 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-26 22:24:18,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.98 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 98.7 MB in the beginning and 153.3 MB in the end (delta: -54.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:24:18,007 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.05 ms. Allocated memory is still 200.8 MB. Free memory was 153.3 MB in the beginning and 150.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:24:18,008 INFO L168 Benchmark]: Boogie Preprocessor took 47.05 ms. Allocated memory is still 200.8 MB. Free memory was 150.3 MB in the beginning and 148.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:24:18,009 INFO L168 Benchmark]: RCFGBuilder took 821.92 ms. Allocated memory is still 200.8 MB. Free memory was 148.4 MB in the beginning and 102.2 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-26 22:24:18,009 INFO L168 Benchmark]: TraceAbstraction took 18543.91 ms. Allocated memory was 200.8 MB in the beginning and 1.0 GB in the end (delta: 812.6 MB). Free memory was 101.2 MB in the beginning and 240.6 MB in the end (delta: -139.3 MB). Peak memory consumption was 673.3 MB. Max. memory is 7.1 GB. [2019-12-26 22:24:18,013 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.28 ms. Allocated memory is still 137.4 MB. Free memory is still 118.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.98 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 98.7 MB in the beginning and 153.3 MB in the end (delta: -54.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.05 ms. Allocated memory is still 200.8 MB. Free memory was 153.3 MB in the beginning and 150.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.05 ms. Allocated memory is still 200.8 MB. Free memory was 150.3 MB in the beginning and 148.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 821.92 ms. Allocated memory is still 200.8 MB. Free memory was 148.4 MB in the beginning and 102.2 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18543.91 ms. Allocated memory was 200.8 MB in the beginning and 1.0 GB in the end (delta: 812.6 MB). Free memory was 101.2 MB in the beginning and 240.6 MB in the end (delta: -139.3 MB). Peak memory consumption was 673.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 171 ProgramPointsBefore, 79 ProgramPointsAfterwards, 193 TransitionsBefore, 87 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 19 ChoiceCompositions, 5629 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 54 SemBasedMoverChecksPositive, 182 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 48496 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t952, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 1 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 3 y = 1 [L775] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 3 z$flush_delayed = weak$$choice2 [L778] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L780] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L857] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 159 locations, 2 error locations. Result: UNSAFE, OverallTime: 18.2s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2201 SDtfs, 2392 SDslu, 3895 SDs, 0 SdLazy, 1354 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26302occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 4062 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 614 NumberOfCodeBlocks, 614 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 549 ConstructedInterpolants, 0 QuantifiedInterpolants, 75731 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...