/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:23:55,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:23:55,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:23:55,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:23:55,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:23:55,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:23:55,453 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:23:55,466 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:23:55,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:23:55,470 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:23:55,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:23:55,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:23:55,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:23:55,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:23:55,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:23:55,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:23:55,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:23:55,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:23:55,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:23:55,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:23:55,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:23:55,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:23:55,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:23:55,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:23:55,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:23:55,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:23:55,495 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:23:55,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:23:55,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:23:55,497 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:23:55,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:23:55,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:23:55,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:23:55,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:23:55,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:23:55,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:23:55,501 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:23:55,501 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:23:55,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:23:55,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:23:55,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:23:55,504 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:23:55,518 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:23:55,518 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:23:55,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:23:55,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:23:55,520 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:23:55,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:23:55,520 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:23:55,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:23:55,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:23:55,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:23:55,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:23:55,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:23:55,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:23:55,522 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:23:55,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:23:55,522 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:23:55,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:23:55,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:23:55,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:23:55,523 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:23:55,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:23:55,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:23:55,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:23:55,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:23:55,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:23:55,524 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:23:55,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:23:55,524 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:23:55,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:23:55,525 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:23:55,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:23:55,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:23:55,810 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:23:55,814 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:23:55,815 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:23:55,815 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:23:55,816 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.opt.i [2019-12-27 17:23:55,887 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f46e526c/c3b36fb0558342b1922d679da87bf526/FLAGa551d34d3 [2019-12-27 17:23:56,438 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:23:56,438 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_tso.opt.i [2019-12-27 17:23:56,461 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f46e526c/c3b36fb0558342b1922d679da87bf526/FLAGa551d34d3 [2019-12-27 17:23:56,755 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f46e526c/c3b36fb0558342b1922d679da87bf526 [2019-12-27 17:23:56,763 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:23:56,765 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:23:56,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:23:56,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:23:56,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:23:56,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:23:56" (1/1) ... [2019-12-27 17:23:56,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c0a7b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:56, skipping insertion in model container [2019-12-27 17:23:56,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:23:56" (1/1) ... [2019-12-27 17:23:56,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:23:56,828 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:23:57,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:23:57,397 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:23:57,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:23:57,540 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:23:57,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:57 WrapperNode [2019-12-27 17:23:57,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:23:57,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:23:57,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:23:57,542 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:23:57,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:57" (1/1) ... [2019-12-27 17:23:57,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:57" (1/1) ... [2019-12-27 17:23:57,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:23:57,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:23:57,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:23:57,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:23:57,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:57" (1/1) ... [2019-12-27 17:23:57,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:57" (1/1) ... [2019-12-27 17:23:57,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:57" (1/1) ... [2019-12-27 17:23:57,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:57" (1/1) ... [2019-12-27 17:23:57,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:57" (1/1) ... [2019-12-27 17:23:57,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:57" (1/1) ... [2019-12-27 17:23:57,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:57" (1/1) ... [2019-12-27 17:23:57,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:23:57,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:23:57,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:23:57,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:23:57,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:23:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:23:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:23:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:23:57,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:23:57,739 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:23:57,739 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:23:57,740 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:23:57,740 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:23:57,740 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:23:57,741 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:23:57,741 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 17:23:57,741 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 17:23:57,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:23:57,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:23:57,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:23:57,743 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:23:58,408 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:23:58,408 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:23:58,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:23:58 BoogieIcfgContainer [2019-12-27 17:23:58,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:23:58,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:23:58,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:23:58,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:23:58,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:23:56" (1/3) ... [2019-12-27 17:23:58,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0e2f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:23:58, skipping insertion in model container [2019-12-27 17:23:58,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:23:57" (2/3) ... [2019-12-27 17:23:58,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0e2f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:23:58, skipping insertion in model container [2019-12-27 17:23:58,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:23:58" (3/3) ... [2019-12-27 17:23:58,419 INFO L109 eAbstractionObserver]: Analyzing ICFG mix051_tso.opt.i [2019-12-27 17:23:58,430 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:23:58,430 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:23:58,440 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:23:58,441 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:23:58,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,498 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,499 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,500 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,500 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,506 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,506 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,523 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,524 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,525 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,550 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,551 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,552 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,553 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,553 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,553 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,553 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,564 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,566 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,570 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,570 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,572 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,572 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,575 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,576 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,578 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,579 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:23:58,594 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 17:23:58,614 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:23:58,615 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:23:58,615 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:23:58,615 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:23:58,615 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:23:58,615 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:23:58,615 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:23:58,615 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:23:58,632 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 190 transitions [2019-12-27 17:23:58,634 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-27 17:23:58,730 INFO L132 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-27 17:23:58,731 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:23:58,748 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 17:23:58,778 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 168 places, 190 transitions [2019-12-27 17:23:58,833 INFO L132 PetriNetUnfolder]: 35/186 cut-off events. [2019-12-27 17:23:58,833 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:23:58,842 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 35/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 349 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 17:23:58,864 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 17:23:58,865 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:24:04,219 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 17:24:04,359 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 17:24:04,388 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46836 [2019-12-27 17:24:04,388 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-27 17:24:04,392 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 84 transitions [2019-12-27 17:24:05,858 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 24606 states. [2019-12-27 17:24:05,859 INFO L276 IsEmpty]: Start isEmpty. Operand 24606 states. [2019-12-27 17:24:05,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 17:24:05,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:24:05,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:24:05,867 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-27 17:24:05,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:24:05,872 INFO L82 PathProgramCache]: Analyzing trace with hash -112021246, now seen corresponding path program 1 times [2019-12-27 17:24:05,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:24:05,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878166694] [2019-12-27 17:24:05,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:24:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:24:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:24:06,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878166694] [2019-12-27 17:24:06,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:24:06,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:24:06,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1200516971] [2019-12-27 17:24:06,168 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:24:06,176 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:24:06,203 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 17:24:06,205 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:24:06,210 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:24:06,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:24:06,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:24:06,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:24:06,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:24:06,228 INFO L87 Difference]: Start difference. First operand 24606 states. Second operand 3 states. [2019-12-27 17:24:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:24:07,249 INFO L93 Difference]: Finished difference Result 23966 states and 104480 transitions. [2019-12-27 17:24:07,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:24:07,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 17:24:07,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:24:07,467 INFO L225 Difference]: With dead ends: 23966 [2019-12-27 17:24:07,468 INFO L226 Difference]: Without dead ends: 22574 [2019-12-27 17:24:07,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:24:07,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22574 states. [2019-12-27 17:24:08,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22574 to 22574. [2019-12-27 17:24:08,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22574 states. [2019-12-27 17:24:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22574 states to 22574 states and 98268 transitions. [2019-12-27 17:24:08,788 INFO L78 Accepts]: Start accepts. Automaton has 22574 states and 98268 transitions. Word has length 9 [2019-12-27 17:24:08,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:24:08,789 INFO L462 AbstractCegarLoop]: Abstraction has 22574 states and 98268 transitions. [2019-12-27 17:24:08,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:24:08,789 INFO L276 IsEmpty]: Start isEmpty. Operand 22574 states and 98268 transitions. [2019-12-27 17:24:08,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 17:24:08,803 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:24:08,803 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:24:08,803 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-27 17:24:08,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:24:08,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1478915767, now seen corresponding path program 1 times [2019-12-27 17:24:08,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:24:08,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694032158] [2019-12-27 17:24:08,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:24:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:24:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:24:08,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694032158] [2019-12-27 17:24:08,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:24:08,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:24:08,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1936419188] [2019-12-27 17:24:08,963 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:24:08,965 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:24:08,970 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 17:24:08,970 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:24:08,971 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:24:08,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:24:08,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:24:08,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:24:08,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:24:08,973 INFO L87 Difference]: Start difference. First operand 22574 states and 98268 transitions. Second operand 4 states. [2019-12-27 17:24:10,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:24:10,366 INFO L93 Difference]: Finished difference Result 34006 states and 143332 transitions. [2019-12-27 17:24:10,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:24:10,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 17:24:10,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:24:10,530 INFO L225 Difference]: With dead ends: 34006 [2019-12-27 17:24:10,530 INFO L226 Difference]: Without dead ends: 33954 [2019-12-27 17:24:10,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:24:10,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33954 states. [2019-12-27 17:24:11,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33954 to 30266. [2019-12-27 17:24:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30266 states. [2019-12-27 17:24:12,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30266 states to 30266 states and 129516 transitions. [2019-12-27 17:24:12,124 INFO L78 Accepts]: Start accepts. Automaton has 30266 states and 129516 transitions. Word has length 15 [2019-12-27 17:24:12,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:24:12,124 INFO L462 AbstractCegarLoop]: Abstraction has 30266 states and 129516 transitions. [2019-12-27 17:24:12,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:24:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 30266 states and 129516 transitions. [2019-12-27 17:24:12,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 17:24:12,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:24:12,139 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:24:12,139 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-27 17:24:12,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:24:12,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1507356133, now seen corresponding path program 1 times [2019-12-27 17:24:12,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:24:12,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481220083] [2019-12-27 17:24:12,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:24:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:24:12,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:24:12,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481220083] [2019-12-27 17:24:12,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:24:12,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:24:12,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2044622251] [2019-12-27 17:24:12,191 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:24:12,193 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:24:12,198 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 17:24:12,198 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:24:12,248 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:24:12,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:24:12,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:24:12,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:24:12,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:24:12,249 INFO L87 Difference]: Start difference. First operand 30266 states and 129516 transitions. Second operand 5 states. [2019-12-27 17:24:12,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:24:12,544 INFO L93 Difference]: Finished difference Result 39490 states and 165892 transitions. [2019-12-27 17:24:12,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:24:12,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 17:24:12,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:24:12,793 INFO L225 Difference]: With dead ends: 39490 [2019-12-27 17:24:12,794 INFO L226 Difference]: Without dead ends: 39490 [2019-12-27 17:24:12,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:24:13,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39490 states. [2019-12-27 17:24:15,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39490 to 32622. [2019-12-27 17:24:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32622 states. [2019-12-27 17:24:15,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32622 states to 32622 states and 139128 transitions. [2019-12-27 17:24:15,543 INFO L78 Accepts]: Start accepts. Automaton has 32622 states and 139128 transitions. Word has length 18 [2019-12-27 17:24:15,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:24:15,543 INFO L462 AbstractCegarLoop]: Abstraction has 32622 states and 139128 transitions. [2019-12-27 17:24:15,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:24:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 32622 states and 139128 transitions. [2019-12-27 17:24:15,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 17:24:15,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:24:15,551 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:24:15,551 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-27 17:24:15,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:24:15,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1390873323, now seen corresponding path program 1 times [2019-12-27 17:24:15,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:24:15,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863380728] [2019-12-27 17:24:15,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:24:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:24:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:24:15,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863380728] [2019-12-27 17:24:15,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:24:15,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:24:15,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [937099213] [2019-12-27 17:24:15,655 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:24:15,658 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:24:15,662 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 17:24:15,662 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:24:15,698 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:24:15,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:24:15,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:24:15,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:24:15,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:24:15,701 INFO L87 Difference]: Start difference. First operand 32622 states and 139128 transitions. Second operand 5 states. [2019-12-27 17:24:16,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:24:16,359 INFO L93 Difference]: Finished difference Result 39306 states and 164888 transitions. [2019-12-27 17:24:16,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:24:16,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 17:24:16,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:24:16,498 INFO L225 Difference]: With dead ends: 39306 [2019-12-27 17:24:16,499 INFO L226 Difference]: Without dead ends: 39270 [2019-12-27 17:24:16,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:24:16,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39270 states. [2019-12-27 17:24:17,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39270 to 34278. [2019-12-27 17:24:17,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34278 states. [2019-12-27 17:24:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34278 states to 34278 states and 145700 transitions. [2019-12-27 17:24:17,809 INFO L78 Accepts]: Start accepts. Automaton has 34278 states and 145700 transitions. Word has length 18 [2019-12-27 17:24:17,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:24:17,809 INFO L462 AbstractCegarLoop]: Abstraction has 34278 states and 145700 transitions. [2019-12-27 17:24:17,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:24:17,809 INFO L276 IsEmpty]: Start isEmpty. Operand 34278 states and 145700 transitions. [2019-12-27 17:24:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 17:24:17,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:24:17,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:24:17,818 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-27 17:24:17,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:24:17,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1775846621, now seen corresponding path program 1 times [2019-12-27 17:24:17,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:24:17,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35384325] [2019-12-27 17:24:17,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:24:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:24:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:24:17,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35384325] [2019-12-27 17:24:17,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:24:17,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:24:17,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1972147071] [2019-12-27 17:24:17,902 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:24:17,907 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:24:17,914 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 54 transitions. [2019-12-27 17:24:17,914 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:24:17,942 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:24:17,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:24:17,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:24:17,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:24:17,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:24:17,943 INFO L87 Difference]: Start difference. First operand 34278 states and 145700 transitions. Second operand 5 states. [2019-12-27 17:24:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:24:19,979 INFO L93 Difference]: Finished difference Result 43030 states and 180576 transitions. [2019-12-27 17:24:19,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:24:19,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-27 17:24:19,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:24:20,121 INFO L225 Difference]: With dead ends: 43030 [2019-12-27 17:24:20,121 INFO L226 Difference]: Without dead ends: 42978 [2019-12-27 17:24:20,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:24:20,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42978 states. [2019-12-27 17:24:21,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42978 to 35550. [2019-12-27 17:24:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35550 states. [2019-12-27 17:24:21,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35550 states to 35550 states and 151224 transitions. [2019-12-27 17:24:21,130 INFO L78 Accepts]: Start accepts. Automaton has 35550 states and 151224 transitions. Word has length 18 [2019-12-27 17:24:21,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:24:21,130 INFO L462 AbstractCegarLoop]: Abstraction has 35550 states and 151224 transitions. [2019-12-27 17:24:21,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:24:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 35550 states and 151224 transitions. [2019-12-27 17:24:21,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 17:24:21,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:24:21,143 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] [2019-12-27 17:24:21,143 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-27 17:24:21,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:24:21,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1801202898, now seen corresponding path program 1 times [2019-12-27 17:24:21,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:24:21,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035084398] [2019-12-27 17:24:21,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:24:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:24:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:24:21,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035084398] [2019-12-27 17:24:21,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:24:21,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:24:21,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1811734129] [2019-12-27 17:24:21,198 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:24:21,201 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:24:21,203 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 21 states and 20 transitions. [2019-12-27 17:24:21,203 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:24:21,204 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:24:21,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:24:21,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:24:21,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:24:21,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:24:21,205 INFO L87 Difference]: Start difference. First operand 35550 states and 151224 transitions. Second operand 3 states. [2019-12-27 17:24:21,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:24:21,437 INFO L93 Difference]: Finished difference Result 34861 states and 147588 transitions. [2019-12-27 17:24:21,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:24:21,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-27 17:24:21,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:24:21,535 INFO L225 Difference]: With dead ends: 34861 [2019-12-27 17:24:21,535 INFO L226 Difference]: Without dead ends: 34861 [2019-12-27 17:24:21,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:24:21,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34861 states. [2019-12-27 17:24:22,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34861 to 34861. [2019-12-27 17:24:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34861 states. [2019-12-27 17:24:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34861 states to 34861 states and 147588 transitions. [2019-12-27 17:24:22,671 INFO L78 Accepts]: Start accepts. Automaton has 34861 states and 147588 transitions. Word has length 20 [2019-12-27 17:24:22,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:24:22,671 INFO L462 AbstractCegarLoop]: Abstraction has 34861 states and 147588 transitions. [2019-12-27 17:24:22,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:24:22,672 INFO L276 IsEmpty]: Start isEmpty. Operand 34861 states and 147588 transitions. [2019-12-27 17:24:22,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 17:24:22,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:24:22,685 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] [2019-12-27 17:24:22,685 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-27 17:24:22,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:24:22,686 INFO L82 PathProgramCache]: Analyzing trace with hash -348621301, now seen corresponding path program 1 times [2019-12-27 17:24:22,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:24:22,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254357866] [2019-12-27 17:24:22,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:24:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:24:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:24:22,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254357866] [2019-12-27 17:24:22,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:24:22,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:24:22,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [24229225] [2019-12-27 17:24:22,734 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:24:22,736 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:24:22,740 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 33 transitions. [2019-12-27 17:24:22,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:24:22,740 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:24:22,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:24:22,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:24:22,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:24:22,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:24:22,741 INFO L87 Difference]: Start difference. First operand 34861 states and 147588 transitions. Second operand 3 states. [2019-12-27 17:24:22,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:24:22,957 INFO L93 Difference]: Finished difference Result 43058 states and 172870 transitions. [2019-12-27 17:24:22,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:24:22,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 17:24:22,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:24:23,043 INFO L225 Difference]: With dead ends: 43058 [2019-12-27 17:24:23,044 INFO L226 Difference]: Without dead ends: 35385 [2019-12-27 17:24:23,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:24:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35385 states. [2019-12-27 17:24:24,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35385 to 34652. [2019-12-27 17:24:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34652 states. [2019-12-27 17:24:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34652 states to 34652 states and 138117 transitions. [2019-12-27 17:24:24,184 INFO L78 Accepts]: Start accepts. Automaton has 34652 states and 138117 transitions. Word has length 21 [2019-12-27 17:24:24,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:24:24,184 INFO L462 AbstractCegarLoop]: Abstraction has 34652 states and 138117 transitions. [2019-12-27 17:24:24,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:24:24,185 INFO L276 IsEmpty]: Start isEmpty. Operand 34652 states and 138117 transitions. [2019-12-27 17:24:24,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 17:24:24,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:24:24,195 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] [2019-12-27 17:24:24,195 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-27 17:24:24,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:24:24,195 INFO L82 PathProgramCache]: Analyzing trace with hash 281464718, now seen corresponding path program 1 times [2019-12-27 17:24:24,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:24:24,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481925893] [2019-12-27 17:24:24,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:24:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:24:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:24:24,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481925893] [2019-12-27 17:24:24,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:24:24,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:24:24,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [443733361] [2019-12-27 17:24:24,285 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:24:24,289 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:24:24,293 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 29 transitions. [2019-12-27 17:24:24,293 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:24:24,294 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:24:24,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:24:24,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:24:24,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:24:24,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:24:24,295 INFO L87 Difference]: Start difference. First operand 34652 states and 138117 transitions. Second operand 5 states. [2019-12-27 17:24:24,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:24:24,408 INFO L93 Difference]: Finished difference Result 15467 states and 50655 transitions. [2019-12-27 17:24:24,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:24:24,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 17:24:24,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:24:24,429 INFO L225 Difference]: With dead ends: 15467 [2019-12-27 17:24:24,429 INFO L226 Difference]: Without dead ends: 13028 [2019-12-27 17:24:24,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:24:24,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13028 states. [2019-12-27 17:24:24,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13028 to 13028. [2019-12-27 17:24:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13028 states. [2019-12-27 17:24:24,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13028 states to 13028 states and 41754 transitions. [2019-12-27 17:24:24,621 INFO L78 Accepts]: Start accepts. Automaton has 13028 states and 41754 transitions. Word has length 21 [2019-12-27 17:24:24,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:24:24,621 INFO L462 AbstractCegarLoop]: Abstraction has 13028 states and 41754 transitions. [2019-12-27 17:24:24,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:24:24,621 INFO L276 IsEmpty]: Start isEmpty. Operand 13028 states and 41754 transitions. [2019-12-27 17:24:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 17:24:24,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:24:24,625 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:24:24,625 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-27 17:24:24,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:24:24,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1933146031, now seen corresponding path program 1 times [2019-12-27 17:24:24,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:24:24,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583232913] [2019-12-27 17:24:24,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:24:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:24:24,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:24:24,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583232913] [2019-12-27 17:24:24,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:24:24,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:24:24,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2110874607] [2019-12-27 17:24:24,712 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:24:24,715 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:24:24,720 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 42 transitions. [2019-12-27 17:24:24,720 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:24:24,721 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:24:24,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:24:24,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:24:24,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:24:24,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:24:24,722 INFO L87 Difference]: Start difference. First operand 13028 states and 41754 transitions. Second operand 6 states. [2019-12-27 17:24:24,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:24:24,827 INFO L93 Difference]: Finished difference Result 4493 states and 12952 transitions. [2019-12-27 17:24:24,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:24:24,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 17:24:24,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:24:24,835 INFO L225 Difference]: With dead ends: 4493 [2019-12-27 17:24:24,835 INFO L226 Difference]: Without dead ends: 3671 [2019-12-27 17:24:24,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:24:24,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2019-12-27 17:24:24,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3631. [2019-12-27 17:24:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3631 states. [2019-12-27 17:24:24,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3631 states to 3631 states and 10398 transitions. [2019-12-27 17:24:24,959 INFO L78 Accepts]: Start accepts. Automaton has 3631 states and 10398 transitions. Word has length 22 [2019-12-27 17:24:24,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:24:24,960 INFO L462 AbstractCegarLoop]: Abstraction has 3631 states and 10398 transitions. [2019-12-27 17:24:24,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:24:24,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3631 states and 10398 transitions. [2019-12-27 17:24:24,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 17:24:24,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:24:24,966 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] [2019-12-27 17:24:24,966 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-27 17:24:24,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:24:24,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1547062574, now seen corresponding path program 1 times [2019-12-27 17:24:24,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:24:24,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441026351] [2019-12-27 17:24:24,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:24:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:24:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:24:25,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441026351] [2019-12-27 17:24:25,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:24:25,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:24:25,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2065284990] [2019-12-27 17:24:25,059 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:24:25,064 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:24:25,082 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 107 transitions. [2019-12-27 17:24:25,082 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:24:25,106 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:24:25,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:24:25,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:24:25,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:24:25,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:24:25,108 INFO L87 Difference]: Start difference. First operand 3631 states and 10398 transitions. Second operand 8 states. [2019-12-27 17:24:25,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:24:25,279 INFO L93 Difference]: Finished difference Result 2817 states and 8323 transitions. [2019-12-27 17:24:25,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:24:25,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-12-27 17:24:25,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:24:25,285 INFO L225 Difference]: With dead ends: 2817 [2019-12-27 17:24:25,285 INFO L226 Difference]: Without dead ends: 2011 [2019-12-27 17:24:25,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:24:25,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2019-12-27 17:24:25,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 1891. [2019-12-27 17:24:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1891 states. [2019-12-27 17:24:25,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 5474 transitions. [2019-12-27 17:24:25,323 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 5474 transitions. Word has length 31 [2019-12-27 17:24:25,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:24:25,324 INFO L462 AbstractCegarLoop]: Abstraction has 1891 states and 5474 transitions. [2019-12-27 17:24:25,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:24:25,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 5474 transitions. [2019-12-27 17:24:25,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 17:24:25,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:24:25,328 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] [2019-12-27 17:24:25,329 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-27 17:24:25,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:24:25,329 INFO L82 PathProgramCache]: Analyzing trace with hash 84854841, now seen corresponding path program 1 times [2019-12-27 17:24:25,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:24:25,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59642568] [2019-12-27 17:24:25,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:24:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:24:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:24:25,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59642568] [2019-12-27 17:24:25,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:24:25,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:24:25,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1626979957] [2019-12-27 17:24:25,396 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:24:25,409 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:24:25,477 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 183 transitions. [2019-12-27 17:24:25,477 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:24:25,478 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:24:25,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:24:25,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:24:25,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:24:25,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:24:25,479 INFO L87 Difference]: Start difference. First operand 1891 states and 5474 transitions. Second operand 4 states. [2019-12-27 17:24:25,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:24:25,505 INFO L93 Difference]: Finished difference Result 2893 states and 8217 transitions. [2019-12-27 17:24:25,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:24:25,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-12-27 17:24:25,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:24:25,509 INFO L225 Difference]: With dead ends: 2893 [2019-12-27 17:24:25,509 INFO L226 Difference]: Without dead ends: 1627 [2019-12-27 17:24:25,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:24:25,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2019-12-27 17:24:25,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1627. [2019-12-27 17:24:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1627 states. [2019-12-27 17:24:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 4632 transitions. [2019-12-27 17:24:25,536 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 4632 transitions. Word has length 46 [2019-12-27 17:24:25,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:24:25,537 INFO L462 AbstractCegarLoop]: Abstraction has 1627 states and 4632 transitions. [2019-12-27 17:24:25,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:24:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 4632 transitions. [2019-12-27 17:24:25,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 17:24:25,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:24:25,541 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] [2019-12-27 17:24:25,541 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-27 17:24:25,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:24:25,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1054276201, now seen corresponding path program 2 times [2019-12-27 17:24:25,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:24:25,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549032603] [2019-12-27 17:24:25,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:24:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:24:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:24:25,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549032603] [2019-12-27 17:24:25,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:24:25,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:24:25,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1966625797] [2019-12-27 17:24:25,629 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:24:25,641 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:24:25,793 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 475 transitions. [2019-12-27 17:24:25,794 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:24:25,821 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:24:25,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:24:25,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:24:25,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:24:25,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:24:25,822 INFO L87 Difference]: Start difference. First operand 1627 states and 4632 transitions. Second operand 6 states. [2019-12-27 17:24:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:24:26,051 INFO L93 Difference]: Finished difference Result 2678 states and 7389 transitions. [2019-12-27 17:24:26,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:24:26,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-12-27 17:24:26,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:24:26,053 INFO L225 Difference]: With dead ends: 2678 [2019-12-27 17:24:26,053 INFO L226 Difference]: Without dead ends: 670 [2019-12-27 17:24:26,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:24:26,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-12-27 17:24:26,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 421. [2019-12-27 17:24:26,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-12-27 17:24:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 942 transitions. [2019-12-27 17:24:26,059 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 942 transitions. Word has length 46 [2019-12-27 17:24:26,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:24:26,060 INFO L462 AbstractCegarLoop]: Abstraction has 421 states and 942 transitions. [2019-12-27 17:24:26,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:24:26,060 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 942 transitions. [2019-12-27 17:24:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 17:24:26,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:24:26,060 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] [2019-12-27 17:24:26,061 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-27 17:24:26,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:24:26,061 INFO L82 PathProgramCache]: Analyzing trace with hash 401636329, now seen corresponding path program 3 times [2019-12-27 17:24:26,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:24:26,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366699804] [2019-12-27 17:24:26,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:24:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:24:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:24:26,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366699804] [2019-12-27 17:24:26,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:24:26,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:24:26,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1341242357] [2019-12-27 17:24:26,146 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:24:26,157 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:24:26,213 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 100 states and 152 transitions. [2019-12-27 17:24:26,214 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:24:26,252 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 17:24:26,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:24:26,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:24:26,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:24:26,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:24:26,253 INFO L87 Difference]: Start difference. First operand 421 states and 942 transitions. Second operand 7 states. [2019-12-27 17:24:26,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:24:26,426 INFO L93 Difference]: Finished difference Result 808 states and 1765 transitions. [2019-12-27 17:24:26,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:24:26,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-12-27 17:24:26,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:24:26,427 INFO L225 Difference]: With dead ends: 808 [2019-12-27 17:24:26,428 INFO L226 Difference]: Without dead ends: 544 [2019-12-27 17:24:26,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:24:26,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-12-27 17:24:26,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 484. [2019-12-27 17:24:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-27 17:24:26,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1050 transitions. [2019-12-27 17:24:26,435 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1050 transitions. Word has length 46 [2019-12-27 17:24:26,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:24:26,435 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 1050 transitions. [2019-12-27 17:24:26,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:24:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1050 transitions. [2019-12-27 17:24:26,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 17:24:26,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:24:26,437 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] [2019-12-27 17:24:26,437 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-27 17:24:26,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:24:26,437 INFO L82 PathProgramCache]: Analyzing trace with hash -683037313, now seen corresponding path program 4 times [2019-12-27 17:24:26,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:24:26,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024079926] [2019-12-27 17:24:26,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:24:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:24:26,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:24:26,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024079926] [2019-12-27 17:24:26,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:24:26,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:24:26,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1581958286] [2019-12-27 17:24:26,573 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:24:26,584 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:24:26,678 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 103 states and 153 transitions. [2019-12-27 17:24:26,679 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:24:26,679 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:24:26,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:24:26,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:24:26,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:24:26,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:24:26,680 INFO L87 Difference]: Start difference. First operand 484 states and 1050 transitions. Second operand 3 states. [2019-12-27 17:24:26,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:24:26,698 INFO L93 Difference]: Finished difference Result 482 states and 1045 transitions. [2019-12-27 17:24:26,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:24:26,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-27 17:24:26,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:24:26,699 INFO L225 Difference]: With dead ends: 482 [2019-12-27 17:24:26,699 INFO L226 Difference]: Without dead ends: 482 [2019-12-27 17:24:26,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:24:26,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-27 17:24:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2019-12-27 17:24:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-12-27 17:24:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1045 transitions. [2019-12-27 17:24:26,706 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1045 transitions. Word has length 46 [2019-12-27 17:24:26,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:24:26,707 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 1045 transitions. [2019-12-27 17:24:26,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:24:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1045 transitions. [2019-12-27 17:24:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 17:24:26,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:24:26,708 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-27 17:24:26,708 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-27 17:24:26,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:24:26,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1677183059, now seen corresponding path program 1 times [2019-12-27 17:24:26,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:24:26,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681948473] [2019-12-27 17:24:26,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:24:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:24:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:24:26,837 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:24:26,838 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:24:26,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= 0 v_~z$r_buff0_thd4~0_184) (= 0 v_~__unbuffered_p2_EAX~0_43) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t1381~0.base_36| 1)) (= v_~z$mem_tmp~0_33 0) (= 0 v_~z$r_buff0_thd3~0_318) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1381~0.base_36|)) (= 0 v_~z$r_buff1_thd4~0_160) (= v_~weak$$choice2~0_130 0) (= v_~z$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= 0 |v_ULTIMATE.start_main_~#t1381~0.offset_23|) (= v_~z$read_delayed_var~0.base_8 0) (= 0 v_~z$r_buff1_thd1~0_92) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p1_EAX~0_54) (= v_~z$r_buff1_thd0~0_160 0) (= 0 v_~z$r_buff1_thd2~0_92) (= 0 v_~weak$$choice0~0_21) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1381~0.base_36| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1381~0.base_36|) |v_ULTIMATE.start_main_~#t1381~0.offset_23| 0)) |v_#memory_int_19|) (= 0 v_~z$r_buff1_thd3~0_237) (= v_~__unbuffered_p3_EAX~0_110 0) (= 0 v_~z$flush_delayed~0_68) (= v_~z$w_buff1_used~0_386 0) (= v_~x~0_77 0) (= v_~z~0_154 0) (= v_~y~0_44 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1381~0.base_36|) (= |v_#NULL.offset_5| 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1381~0.base_36| 4)) (= v_~a~0_69 0) (= v_~__unbuffered_cnt~0_186 0) (= v_~z$r_buff0_thd1~0_47 0) (= v_~z$w_buff0~0_354 0) (= v_~z$w_buff1~0_215 0) (= v_~z$w_buff0_used~0_630 0) (= v_~z$r_buff0_thd2~0_47 0) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_122 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_20|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_92, ULTIMATE.start_main_~#t1381~0.base=|v_ULTIMATE.start_main_~#t1381~0.base_36|, #NULL.offset=|v_#NULL.offset_5|, ~a~0=v_~a~0_69, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_122, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_184, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_110, ULTIMATE.start_main_~#t1384~0.base=|v_ULTIMATE.start_main_~#t1384~0.base_17|, #length=|v_#length_27|, ULTIMATE.start_main_~#t1382~0.offset=|v_ULTIMATE.start_main_~#t1382~0.offset_24|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~z$mem_tmp~0=v_~z$mem_tmp~0_33, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_35|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_54|, ~z$flush_delayed~0=v_~z$flush_delayed~0_68, ULTIMATE.start_main_~#t1382~0.base=|v_ULTIMATE.start_main_~#t1382~0.base_37|, ULTIMATE.start_main_~#t1384~0.offset=|v_ULTIMATE.start_main_~#t1384~0.offset_14|, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_33|, ULTIMATE.start_main_~#t1383~0.base=|v_ULTIMATE.start_main_~#t1383~0.base_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_92, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_318, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_186, ~x~0=v_~x~0_77, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_160, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_8|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_14|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_215, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t1383~0.offset=|v_ULTIMATE.start_main_~#t1383~0.offset_24|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_160, ~y~0=v_~y~0_44, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_630, ~z$w_buff0~0=v_~z$w_buff0~0_354, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ULTIMATE.start_main_~#t1381~0.offset=|v_ULTIMATE.start_main_~#t1381~0.offset_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_33|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_72|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_154, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_47} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t1381~0.base, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t1384~0.base, #length, ULTIMATE.start_main_~#t1382~0.offset, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t1382~0.base, ULTIMATE.start_main_~#t1384~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1383~0.base, ~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_~#t1383~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_~#t1381~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite41, 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-27 17:24:26,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L833-1-->L835: Formula: (and (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t1382~0.base_11| 1) |v_#valid_43|) (= 0 |v_ULTIMATE.start_main_~#t1382~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1382~0.base_11|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1382~0.base_11| 4) |v_#length_21|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1382~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1382~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1382~0.base_11|) |v_ULTIMATE.start_main_~#t1382~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t1382~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1382~0.offset=|v_ULTIMATE.start_main_~#t1382~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1382~0.base=|v_ULTIMATE.start_main_~#t1382~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t1382~0.offset, #length, ULTIMATE.start_main_~#t1382~0.base] because there is no mapped edge [2019-12-27 17:24:26,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L835-1-->L837: Formula: (and (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t1383~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1383~0.base_11| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1383~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1383~0.base_11|) |v_ULTIMATE.start_main_~#t1383~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1383~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1383~0.offset_10|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t1383~0.base_11| 1) |v_#valid_41|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1383~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1383~0.base=|v_ULTIMATE.start_main_~#t1383~0.base_11|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1383~0.offset=|v_ULTIMATE.start_main_~#t1383~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1383~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1383~0.offset] because there is no mapped edge [2019-12-27 17:24:26,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L837-1-->L839: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1384~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1384~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1384~0.base_13|) |v_ULTIMATE.start_main_~#t1384~0.offset_11| 3)) |v_#memory_int_15|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1384~0.base_13| 1) |v_#valid_50|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1384~0.base_13|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1384~0.base_13| 4) |v_#length_23|) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1384~0.base_13|) 0) (= |v_ULTIMATE.start_main_~#t1384~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t1384~0.offset=|v_ULTIMATE.start_main_~#t1384~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1384~0.base=|v_ULTIMATE.start_main_~#t1384~0.base_13|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1384~0.offset, ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1384~0.base, #length] because there is no mapped edge [2019-12-27 17:24:26,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_40 v_~z$r_buff1_thd0~0_25) (= v_~z$r_buff1_thd2~0_6 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff1_thd1~0_6 v_~z$r_buff0_thd1~0_7) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_22)) (= v_~a~0_15 v_~__unbuffered_p3_EAX~0_9) (= v_~z$r_buff0_thd4~0_25 1) (= v_~z$r_buff0_thd4~0_26 v_~z$r_buff1_thd4~0_17) (= v_~z$r_buff0_thd3~0_59 v_~z$r_buff1_thd3~0_33)) InVars {~a~0=v_~a~0_15, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_40, P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_22, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_22, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_6, ~a~0=v_~a~0_15, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_25, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_6, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_9, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_25, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_59, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} AuxVars[] AssignedVars[~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] because there is no mapped edge [2019-12-27 17:24:26,848 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_44 1) (= v_P0Thread1of1ForFork2_~arg.base_23 |v_P0Thread1of1ForFork2_#in~arg.base_23|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_23| v_P0Thread1of1ForFork2_~arg.offset_23) (= 0 |v_P0Thread1of1ForFork2_#res.offset_13|) (= v_~__unbuffered_cnt~0_151 (+ v_~__unbuffered_cnt~0_152 1)) (= v_~x~0_51 1) (= |v_P0Thread1of1ForFork2_#res.base_13| 0)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_152, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|} OutVars{~a~0=v_~a~0_44, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_23|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_23, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_23|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_13|, ~x~0=v_~x~0_51, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_23} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-27 17:24:26,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork3_#res.base_7|) (= |v_P1Thread1of1ForFork3_#in~arg.offset_17| v_P1Thread1of1ForFork3_~arg.offset_17) (= |v_P1Thread1of1ForFork3_#in~arg.base_17| v_P1Thread1of1ForFork3_~arg.base_17) (= v_~y~0_22 v_~__unbuffered_p1_EAX~0_21) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= 0 |v_P1Thread1of1ForFork3_#res.offset_7|) (= v_~x~0_33 2)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_22} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_17, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_17|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_17|, ~y~0=v_~y~0_22, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 17:24:26,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1715565836 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1715565836 256) 0))) (or (and (= 0 |P3Thread1of1ForFork1_#t~ite28_Out1715565836|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1715565836 |P3Thread1of1ForFork1_#t~ite28_Out1715565836|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1715565836, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1715565836} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1715565836, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out1715565836|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1715565836} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 17:24:26,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L812-->L812-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2118363858 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-2118363858 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2118363858 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-2118363858 256) 0))) (or (and (= ~z$w_buff1_used~0_In-2118363858 |P3Thread1of1ForFork1_#t~ite29_Out-2118363858|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork1_#t~ite29_Out-2118363858|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2118363858, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2118363858, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2118363858, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2118363858} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2118363858, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out-2118363858|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2118363858, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2118363858, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2118363858} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 17:24:26,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L813-->L814: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2070807915 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-2070807915 256) 0))) (or (and (= 0 ~z$r_buff0_thd4~0_Out-2070807915) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd4~0_In-2070807915 ~z$r_buff0_thd4~0_Out-2070807915)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2070807915, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2070807915} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2070807915, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-2070807915, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-2070807915|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 17:24:26,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In455861914 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In455861914 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In455861914 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In455861914 256) 0))) (or (and (= 0 |P3Thread1of1ForFork1_#t~ite31_Out455861914|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In455861914 |P3Thread1of1ForFork1_#t~ite31_Out455861914|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In455861914, ~z$w_buff0_used~0=~z$w_buff0_used~0_In455861914, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In455861914, ~z$w_buff1_used~0=~z$w_buff1_used~0_In455861914} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In455861914, ~z$w_buff0_used~0=~z$w_buff0_used~0_In455861914, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In455861914, ~z$w_buff1_used~0=~z$w_buff1_used~0_In455861914, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out455861914|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 17:24:26,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L814-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork1_#res.offset_5| 0) (= |v_P3Thread1of1ForFork1_#t~ite31_62| v_~z$r_buff1_thd4~0_109) (= v_~__unbuffered_cnt~0_133 (+ v_~__unbuffered_cnt~0_134 1)) (= |v_P3Thread1of1ForFork1_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_62|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_109, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_133, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_5|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_61|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 17:24:26,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L778-->L779-8: Formula: (and (= |v_P2Thread1of1ForFork0_#t~ite22_31| |v_P2Thread1of1ForFork0_#t~ite22_30|) (= |v_P2Thread1of1ForFork0_#t~ite23_33| |v_P2Thread1of1ForFork0_#t~ite23_32|) (= v_~z$r_buff0_thd3~0_290 v_~z$r_buff0_thd3~0_289) (not (= (mod v_~weak$$choice2~0_121 256) 0)) (= v_~z$r_buff1_thd3~0_210 |v_P2Thread1of1ForFork0_#t~ite24_46|)) InVars {P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_31|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_210, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_290, ~weak$$choice2~0=v_~weak$$choice2~0_121} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_15|, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_30|, P2Thread1of1ForFork0_#t~ite23=|v_P2Thread1of1ForFork0_#t~ite23_32|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_210, P2Thread1of1ForFork0_#t~ite24=|v_P2Thread1of1ForFork0_#t~ite24_46|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_289, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_31|, ~weak$$choice2~0=v_~weak$$choice2~0_121, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_29|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite22, P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 17:24:26,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L781-->L789: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 17:24:26,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L843-->L845-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_106 256)) (= (mod v_~z$r_buff0_thd0~0_21 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:24:26,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L845-2-->L845-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In647306006 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In647306006 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out647306006| ~z~0_In647306006) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out647306006| ~z$w_buff1~0_In647306006) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In647306006, ~z$w_buff1_used~0=~z$w_buff1_used~0_In647306006, ~z$w_buff1~0=~z$w_buff1~0_In647306006, ~z~0=~z~0_In647306006} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In647306006, ~z$w_buff1_used~0=~z$w_buff1_used~0_In647306006, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out647306006|, ~z$w_buff1~0=~z$w_buff1~0_In647306006, ~z~0=~z~0_In647306006} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 17:24:26,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_13 |v_ULTIMATE.start_main_#t~ite36_7|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_7|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_7|, ~z~0=v_~z~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-27 17:24:26,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In388630794 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In388630794 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out388630794|) (not .cse1)) (and (= ~z$w_buff0_used~0_In388630794 |ULTIMATE.start_main_#t~ite38_Out388630794|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In388630794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In388630794} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In388630794, ~z$w_buff0_used~0=~z$w_buff0_used~0_In388630794, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out388630794|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 17:24:26,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L847-->L847-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1823610694 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1823610694 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1823610694 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1823610694 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out-1823610694| 0)) (and (= |ULTIMATE.start_main_#t~ite39_Out-1823610694| ~z$w_buff1_used~0_In-1823610694) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1823610694, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1823610694, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1823610694, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1823610694} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1823610694, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1823610694|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1823610694, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1823610694, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1823610694} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 17:24:26,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1264013687 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1264013687 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-1264013687 |ULTIMATE.start_main_#t~ite40_Out-1264013687|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite40_Out-1264013687|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1264013687, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1264013687} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1264013687, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1264013687|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1264013687} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 17:24:26,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-936588376 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-936588376 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-936588376 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-936588376 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-936588376 |ULTIMATE.start_main_#t~ite41_Out-936588376|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite41_Out-936588376| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-936588376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-936588376, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-936588376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-936588376} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-936588376|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-936588376, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-936588376, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-936588376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-936588376} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 17:24:26,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_27) (= v_~x~0_63 2) (= v_~main$tmp_guard1~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~z$r_buff1_thd0~0_120 |v_ULTIMATE.start_main_#t~ite41_44|) (= 0 v_~__unbuffered_p3_EAX~0_80) (= 0 v_~__unbuffered_p1_EAX~0_40) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_44|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_80, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x~0=v_~x~0_63} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_43|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_120, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_80, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x~0=v_~x~0_63, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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-27 17:24:26,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:24:26 BasicIcfg [2019-12-27 17:24:26,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:24:26,979 INFO L168 Benchmark]: Toolchain (without parser) took 30210.83 ms. Allocated memory was 147.3 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 103.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 456.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:24:26,980 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 147.3 MB. Free memory was 123.7 MB in the beginning and 123.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 17:24:26,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.74 ms. Allocated memory was 147.3 MB in the beginning and 204.5 MB in the end (delta: 57.1 MB). Free memory was 103.4 MB in the beginning and 158.3 MB in the end (delta: -54.9 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:24:26,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.64 ms. Allocated memory is still 204.5 MB. Free memory was 158.3 MB in the beginning and 155.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:24:26,982 INFO L168 Benchmark]: Boogie Preprocessor took 45.48 ms. Allocated memory is still 204.5 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:24:26,982 INFO L168 Benchmark]: RCFGBuilder took 760.00 ms. Allocated memory is still 204.5 MB. Free memory was 153.1 MB in the beginning and 107.5 MB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:24:26,986 INFO L168 Benchmark]: TraceAbstraction took 28562.46 ms. Allocated memory was 204.5 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 106.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 402.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:24:26,993 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 147.3 MB. Free memory was 123.7 MB in the beginning and 123.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.74 ms. Allocated memory was 147.3 MB in the beginning and 204.5 MB in the end (delta: 57.1 MB). Free memory was 103.4 MB in the beginning and 158.3 MB in the end (delta: -54.9 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.64 ms. Allocated memory is still 204.5 MB. Free memory was 158.3 MB in the beginning and 155.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.48 ms. Allocated memory is still 204.5 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 760.00 ms. Allocated memory is still 204.5 MB. Free memory was 153.1 MB in the beginning and 107.5 MB in the end (delta: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28562.46 ms. Allocated memory was 204.5 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 106.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 402.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 168 ProgramPointsBefore, 77 ProgramPointsAfterwards, 190 TransitionsBefore, 84 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 20 ChoiceCompositions, 5577 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 67 SemBasedMoverChecksPositive, 168 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 46836 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1381, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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] [L835] FCALL, FORK 0 pthread_create(&t1382, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_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] [L837] FCALL, FORK 0 pthread_create(&t1383, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L839] FCALL, FORK 0 pthread_create(&t1384, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L794] 4 z$w_buff1 = z$w_buff0 [L795] 4 z$w_buff0 = 1 [L796] 4 z$w_buff1_used = z$w_buff0_used [L797] 4 z$w_buff0_used = (_Bool)1 [L810] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L766] 3 y = 1 [L769] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 3 z$flush_delayed = weak$$choice2 [L772] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L773] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L810] 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) [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 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 [L773] 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) [L774] EXPR 3 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)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, 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))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L774] 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)) [L775] 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=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L775] 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)) [L776] 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=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L776] 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)) [L777] 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=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L777] 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)) [L779] 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)) [L780] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=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] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 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 [L848] 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, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.2s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1545 SDtfs, 2372 SDslu, 2437 SDs, 0 SdLazy, 801 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35550occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 24178 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 424 NumberOfCodeBlocks, 424 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 363 ConstructedInterpolants, 0 QuantifiedInterpolants, 54577 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...