/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:13:50,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:13:50,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:13:50,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:13:50,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:13:50,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:13:50,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:13:50,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:13:50,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:13:50,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:13:50,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:13:50,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:13:50,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:13:50,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:13:50,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:13:50,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:13:50,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:13:50,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:13:50,458 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:13:50,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:13:50,462 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:13:50,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:13:50,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:13:50,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:13:50,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:13:50,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:13:50,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:13:50,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:13:50,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:13:50,479 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:13:50,479 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:13:50,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:13:50,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:13:50,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:13:50,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:13:50,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:13:50,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:13:50,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:13:50,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:13:50,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:13:50,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:13:50,493 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:13:50,516 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:13:50,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:13:50,519 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:13:50,519 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:13:50,519 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:13:50,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:13:50,520 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:13:50,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:13:50,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:13:50,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:13:50,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:13:50,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:13:50,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:13:50,523 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:13:50,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:13:50,523 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:13:50,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:13:50,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:13:50,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:13:50,524 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:13:50,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:13:50,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:13:50,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:13:50,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:13:50,526 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:13:50,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:13:50,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:13:50,526 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:13:50,526 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:13:50,827 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:13:50,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:13:50,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:13:50,848 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:13:50,849 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:13:50,849 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.oepc.i [2019-12-27 02:13:50,910 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd5aa5b77/e0de358d8b03472aba62ef95ffcec22f/FLAGa7056ae06 [2019-12-27 02:13:51,437 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:13:51,438 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_tso.oepc.i [2019-12-27 02:13:51,457 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd5aa5b77/e0de358d8b03472aba62ef95ffcec22f/FLAGa7056ae06 [2019-12-27 02:13:51,733 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd5aa5b77/e0de358d8b03472aba62ef95ffcec22f [2019-12-27 02:13:51,745 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:13:51,747 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:13:51,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:13:51,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:13:51,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:13:51,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:13:51" (1/1) ... [2019-12-27 02:13:51,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26fc715b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:13:51, skipping insertion in model container [2019-12-27 02:13:51,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:13:51" (1/1) ... [2019-12-27 02:13:51,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:13:51,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:13:52,353 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:13:52,365 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:13:52,457 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:13:52,536 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:13:52,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:13:52 WrapperNode [2019-12-27 02:13:52,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:13:52,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:13:52,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:13:52,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:13:52,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:13:52" (1/1) ... [2019-12-27 02:13:52,570 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:13:52" (1/1) ... [2019-12-27 02:13:52,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:13:52,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:13:52,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:13:52,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:13:52,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:13:52" (1/1) ... [2019-12-27 02:13:52,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:13:52" (1/1) ... [2019-12-27 02:13:52,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:13:52" (1/1) ... [2019-12-27 02:13:52,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:13:52" (1/1) ... [2019-12-27 02:13:52,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:13:52" (1/1) ... [2019-12-27 02:13:52,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:13:52" (1/1) ... [2019-12-27 02:13:52,647 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:13:52" (1/1) ... [2019-12-27 02:13:52,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:13:52,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:13:52,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:13:52,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:13:52,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:13:52" (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 02:13:52,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:13:52,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:13:52,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:13:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:13:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:13:52,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:13:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:13:52,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:13:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:13:52,739 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:13:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 02:13:52,739 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 02:13:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:13:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:13:52,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:13:52,742 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 02:13:53,677 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:13:53,677 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:13:53,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:13:53 BoogieIcfgContainer [2019-12-27 02:13:53,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:13:53,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:13:53,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:13:53,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:13:53,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:13:51" (1/3) ... [2019-12-27 02:13:53,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4078dcb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:13:53, skipping insertion in model container [2019-12-27 02:13:53,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:13:52" (2/3) ... [2019-12-27 02:13:53,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4078dcb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:13:53, skipping insertion in model container [2019-12-27 02:13:53,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:13:53" (3/3) ... [2019-12-27 02:13:53,687 INFO L109 eAbstractionObserver]: Analyzing ICFG mix030_tso.oepc.i [2019-12-27 02:13:53,697 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:13:53,697 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:13:53,705 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:13:53,706 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:13:53,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,746 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,746 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,748 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,748 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,750 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,750 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,757 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,757 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,757 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,757 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,758 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,758 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,758 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,759 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,760 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,761 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,761 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,761 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,761 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,761 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,762 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,762 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,762 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,762 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,762 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,763 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,763 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,763 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,763 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,763 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,764 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,765 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,765 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,765 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,765 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,765 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,765 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,766 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,766 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,766 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,766 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,767 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,767 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,767 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,767 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,767 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,768 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,768 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,768 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,768 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,768 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,769 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,769 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,769 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,769 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,770 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,771 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,772 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,773 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,774 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,775 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,776 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,777 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,777 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,777 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,777 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,777 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,777 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,778 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,779 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,780 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,784 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,784 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,787 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,788 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,793 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,793 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,796 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,796 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,797 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,797 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,797 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,797 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,798 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,798 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,798 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,798 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,798 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,799 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,799 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,799 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,799 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,799 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,799 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,800 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,800 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,800 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,800 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,800 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,801 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,801 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,801 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,801 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,801 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,801 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,802 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,802 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,802 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,802 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,802 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,802 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,803 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:13:53,817 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 02:13:53,837 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:13:53,838 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:13:53,838 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:13:53,838 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:13:53,838 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:13:53,838 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:13:53,838 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:13:53,838 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:13:53,856 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 270 transitions [2019-12-27 02:13:53,858 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 221 places, 270 transitions [2019-12-27 02:13:53,987 INFO L132 PetriNetUnfolder]: 62/266 cut-off events. [2019-12-27 02:13:53,987 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:13:54,010 INFO L76 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 266 events. 62/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 528 event pairs. 0/202 useless extension candidates. Maximal degree in co-relation 235. Up to 2 conditions per place. [2019-12-27 02:13:54,047 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 221 places, 270 transitions [2019-12-27 02:13:54,122 INFO L132 PetriNetUnfolder]: 62/266 cut-off events. [2019-12-27 02:13:54,123 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:13:54,137 INFO L76 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 266 events. 62/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 528 event pairs. 0/202 useless extension candidates. Maximal degree in co-relation 235. Up to 2 conditions per place. [2019-12-27 02:13:54,175 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 28796 [2019-12-27 02:13:54,176 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:13:57,473 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-12-27 02:14:00,880 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 02:14:01,013 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 02:14:01,189 INFO L206 etLargeBlockEncoding]: Checked pairs total: 145015 [2019-12-27 02:14:01,190 INFO L214 etLargeBlockEncoding]: Total number of compositions: 133 [2019-12-27 02:14:01,193 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 122 places, 142 transitions [2019-12-27 02:14:11,881 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 105210 states. [2019-12-27 02:14:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 105210 states. [2019-12-27 02:14:11,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 02:14:11,889 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:14:11,889 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:14:11,890 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:14:11,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:14:11,894 INFO L82 PathProgramCache]: Analyzing trace with hash 487193979, now seen corresponding path program 1 times [2019-12-27 02:14:11,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:14:11,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668059365] [2019-12-27 02:14:11,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:14:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:14:12,152 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 02:14:12,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668059365] [2019-12-27 02:14:12,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:14:12,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:14:12,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128664095] [2019-12-27 02:14:12,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:14:12,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:14:12,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:14:12,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:14:12,179 INFO L87 Difference]: Start difference. First operand 105210 states. Second operand 3 states. [2019-12-27 02:14:15,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:14:15,579 INFO L93 Difference]: Finished difference Result 105018 states and 475984 transitions. [2019-12-27 02:14:15,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:14:15,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 02:14:15,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:14:16,392 INFO L225 Difference]: With dead ends: 105018 [2019-12-27 02:14:16,392 INFO L226 Difference]: Without dead ends: 102886 [2019-12-27 02:14:16,394 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 02:14:18,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102886 states. [2019-12-27 02:14:23,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102886 to 102886. [2019-12-27 02:14:23,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102886 states. [2019-12-27 02:14:27,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102886 states to 102886 states and 466780 transitions. [2019-12-27 02:14:27,421 INFO L78 Accepts]: Start accepts. Automaton has 102886 states and 466780 transitions. Word has length 9 [2019-12-27 02:14:27,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:14:27,422 INFO L462 AbstractCegarLoop]: Abstraction has 102886 states and 466780 transitions. [2019-12-27 02:14:27,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:14:27,423 INFO L276 IsEmpty]: Start isEmpty. Operand 102886 states and 466780 transitions. [2019-12-27 02:14:27,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:14:27,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:14:27,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:14:27,431 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:14:27,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:14:27,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1814849602, now seen corresponding path program 1 times [2019-12-27 02:14:27,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:14:27,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945056608] [2019-12-27 02:14:27,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:14:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:14:27,569 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 02:14:27,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945056608] [2019-12-27 02:14:27,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:14:27,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:14:27,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877627278] [2019-12-27 02:14:27,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:14:27,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:14:27,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:14:27,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:14:27,573 INFO L87 Difference]: Start difference. First operand 102886 states and 466780 transitions. Second operand 4 states. [2019-12-27 02:14:33,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:14:33,716 INFO L93 Difference]: Finished difference Result 165574 states and 725216 transitions. [2019-12-27 02:14:33,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:14:33,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:14:33,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:14:34,502 INFO L225 Difference]: With dead ends: 165574 [2019-12-27 02:14:34,502 INFO L226 Difference]: Without dead ends: 165546 [2019-12-27 02:14:34,503 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 02:14:36,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165546 states. [2019-12-27 02:14:39,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165546 to 160294. [2019-12-27 02:14:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160294 states. [2019-12-27 02:14:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160294 states to 160294 states and 705940 transitions. [2019-12-27 02:14:46,287 INFO L78 Accepts]: Start accepts. Automaton has 160294 states and 705940 transitions. Word has length 15 [2019-12-27 02:14:46,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:14:46,287 INFO L462 AbstractCegarLoop]: Abstraction has 160294 states and 705940 transitions. [2019-12-27 02:14:46,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:14:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 160294 states and 705940 transitions. [2019-12-27 02:14:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:14:46,292 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:14:46,292 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:14:46,292 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:14:46,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:14:46,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1261715161, now seen corresponding path program 1 times [2019-12-27 02:14:46,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:14:46,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631213272] [2019-12-27 02:14:46,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:14:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:14:46,354 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 02:14:46,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631213272] [2019-12-27 02:14:46,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:14:46,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:14:46,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027750837] [2019-12-27 02:14:46,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:14:46,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:14:46,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:14:46,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:14:46,356 INFO L87 Difference]: Start difference. First operand 160294 states and 705940 transitions. Second operand 3 states. [2019-12-27 02:14:48,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:14:48,392 INFO L93 Difference]: Finished difference Result 124009 states and 506087 transitions. [2019-12-27 02:14:48,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:14:48,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 02:14:48,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:14:48,779 INFO L225 Difference]: With dead ends: 124009 [2019-12-27 02:14:48,780 INFO L226 Difference]: Without dead ends: 124009 [2019-12-27 02:14:48,780 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 02:14:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124009 states. [2019-12-27 02:14:57,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124009 to 124009. [2019-12-27 02:14:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124009 states. [2019-12-27 02:14:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124009 states to 124009 states and 506087 transitions. [2019-12-27 02:14:58,695 INFO L78 Accepts]: Start accepts. Automaton has 124009 states and 506087 transitions. Word has length 15 [2019-12-27 02:14:58,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:14:58,695 INFO L462 AbstractCegarLoop]: Abstraction has 124009 states and 506087 transitions. [2019-12-27 02:14:58,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:14:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 124009 states and 506087 transitions. [2019-12-27 02:14:58,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:14:58,697 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:14:58,697 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:14:58,698 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:14:58,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:14:58,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2125901826, now seen corresponding path program 1 times [2019-12-27 02:14:58,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:14:58,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471043294] [2019-12-27 02:14:58,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:14:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:14:58,771 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 02:14:58,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471043294] [2019-12-27 02:14:58,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:14:58,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:14:58,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110445996] [2019-12-27 02:14:58,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:14:58,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:14:58,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:14:58,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:14:58,774 INFO L87 Difference]: Start difference. First operand 124009 states and 506087 transitions. Second operand 4 states. [2019-12-27 02:14:59,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:14:59,020 INFO L93 Difference]: Finished difference Result 48600 states and 166166 transitions. [2019-12-27 02:14:59,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:14:59,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 02:14:59,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:14:59,105 INFO L225 Difference]: With dead ends: 48600 [2019-12-27 02:14:59,105 INFO L226 Difference]: Without dead ends: 48600 [2019-12-27 02:14:59,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:14:59,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48600 states. [2019-12-27 02:15:00,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48600 to 48600. [2019-12-27 02:15:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48600 states. [2019-12-27 02:15:00,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48600 states to 48600 states and 166166 transitions. [2019-12-27 02:15:00,992 INFO L78 Accepts]: Start accepts. Automaton has 48600 states and 166166 transitions. Word has length 16 [2019-12-27 02:15:00,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:00,992 INFO L462 AbstractCegarLoop]: Abstraction has 48600 states and 166166 transitions. [2019-12-27 02:15:00,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:15:00,993 INFO L276 IsEmpty]: Start isEmpty. Operand 48600 states and 166166 transitions. [2019-12-27 02:15:00,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 02:15:00,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:00,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:00,994 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:00,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:00,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2082717748, now seen corresponding path program 1 times [2019-12-27 02:15:00,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:00,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481979016] [2019-12-27 02:15:00,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:01,089 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 02:15:01,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481979016] [2019-12-27 02:15:01,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:01,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:15:01,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285114676] [2019-12-27 02:15:01,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:15:01,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:01,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:15:01,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:15:01,091 INFO L87 Difference]: Start difference. First operand 48600 states and 166166 transitions. Second operand 5 states. [2019-12-27 02:15:01,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:01,150 INFO L93 Difference]: Finished difference Result 6591 states and 18839 transitions. [2019-12-27 02:15:01,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:15:01,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 02:15:01,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:01,163 INFO L225 Difference]: With dead ends: 6591 [2019-12-27 02:15:01,163 INFO L226 Difference]: Without dead ends: 6591 [2019-12-27 02:15:01,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:15:01,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6591 states. [2019-12-27 02:15:01,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6591 to 6591. [2019-12-27 02:15:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6591 states. [2019-12-27 02:15:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6591 states to 6591 states and 18839 transitions. [2019-12-27 02:15:01,251 INFO L78 Accepts]: Start accepts. Automaton has 6591 states and 18839 transitions. Word has length 17 [2019-12-27 02:15:01,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:01,251 INFO L462 AbstractCegarLoop]: Abstraction has 6591 states and 18839 transitions. [2019-12-27 02:15:01,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:15:01,251 INFO L276 IsEmpty]: Start isEmpty. Operand 6591 states and 18839 transitions. [2019-12-27 02:15:01,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 02:15:01,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:01,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:01,258 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:01,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:01,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1699372313, now seen corresponding path program 1 times [2019-12-27 02:15:01,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:01,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959944405] [2019-12-27 02:15:01,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:01,384 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 02:15:01,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959944405] [2019-12-27 02:15:01,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:01,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:15:01,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391376908] [2019-12-27 02:15:01,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:15:01,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:01,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:15:01,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:15:01,387 INFO L87 Difference]: Start difference. First operand 6591 states and 18839 transitions. Second operand 6 states. [2019-12-27 02:15:01,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:01,443 INFO L93 Difference]: Finished difference Result 3660 states and 11520 transitions. [2019-12-27 02:15:01,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:15:01,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 02:15:01,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:01,452 INFO L225 Difference]: With dead ends: 3660 [2019-12-27 02:15:01,452 INFO L226 Difference]: Without dead ends: 3660 [2019-12-27 02:15:01,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:15:01,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2019-12-27 02:15:01,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3464. [2019-12-27 02:15:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3464 states. [2019-12-27 02:15:01,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 10960 transitions. [2019-12-27 02:15:01,503 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 10960 transitions. Word has length 29 [2019-12-27 02:15:01,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:01,504 INFO L462 AbstractCegarLoop]: Abstraction has 3464 states and 10960 transitions. [2019-12-27 02:15:01,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:15:01,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 10960 transitions. [2019-12-27 02:15:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 02:15:01,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:01,512 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:01,513 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:01,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:01,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1142900950, now seen corresponding path program 1 times [2019-12-27 02:15:01,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:01,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752908085] [2019-12-27 02:15:01,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:01,674 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 02:15:01,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752908085] [2019-12-27 02:15:01,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:01,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:15:01,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049677247] [2019-12-27 02:15:01,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:15:01,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:01,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:15:01,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:15:01,676 INFO L87 Difference]: Start difference. First operand 3464 states and 10960 transitions. Second operand 6 states. [2019-12-27 02:15:02,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:02,322 INFO L93 Difference]: Finished difference Result 5233 states and 16394 transitions. [2019-12-27 02:15:02,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:15:02,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-27 02:15:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:02,334 INFO L225 Difference]: With dead ends: 5233 [2019-12-27 02:15:02,335 INFO L226 Difference]: Without dead ends: 5233 [2019-12-27 02:15:02,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:15:02,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5233 states. [2019-12-27 02:15:02,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5233 to 3820. [2019-12-27 02:15:02,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3820 states. [2019-12-27 02:15:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3820 states to 3820 states and 12120 transitions. [2019-12-27 02:15:02,411 INFO L78 Accepts]: Start accepts. Automaton has 3820 states and 12120 transitions. Word has length 74 [2019-12-27 02:15:02,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:02,412 INFO L462 AbstractCegarLoop]: Abstraction has 3820 states and 12120 transitions. [2019-12-27 02:15:02,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:15:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3820 states and 12120 transitions. [2019-12-27 02:15:02,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 02:15:02,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:02,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:02,421 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:02,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:02,421 INFO L82 PathProgramCache]: Analyzing trace with hash -617148552, now seen corresponding path program 2 times [2019-12-27 02:15:02,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:02,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755240698] [2019-12-27 02:15:02,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:02,525 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 02:15:02,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755240698] [2019-12-27 02:15:02,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:02,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:15:02,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858255213] [2019-12-27 02:15:02,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:15:02,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:02,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:15:02,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:15:02,527 INFO L87 Difference]: Start difference. First operand 3820 states and 12120 transitions. Second operand 5 states. [2019-12-27 02:15:02,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:02,786 INFO L93 Difference]: Finished difference Result 4381 states and 13710 transitions. [2019-12-27 02:15:02,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:15:02,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-27 02:15:02,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:02,795 INFO L225 Difference]: With dead ends: 4381 [2019-12-27 02:15:02,795 INFO L226 Difference]: Without dead ends: 4381 [2019-12-27 02:15:02,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:15:02,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4381 states. [2019-12-27 02:15:02,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4381 to 4060. [2019-12-27 02:15:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-12-27 02:15:02,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 12832 transitions. [2019-12-27 02:15:02,842 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 12832 transitions. Word has length 74 [2019-12-27 02:15:02,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:02,843 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 12832 transitions. [2019-12-27 02:15:02,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:15:02,843 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 12832 transitions. [2019-12-27 02:15:02,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 02:15:02,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:02,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:02,852 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:02,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:02,853 INFO L82 PathProgramCache]: Analyzing trace with hash -115763946, now seen corresponding path program 3 times [2019-12-27 02:15:02,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:02,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646491206] [2019-12-27 02:15:02,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:03,660 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 02:15:03,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646491206] [2019-12-27 02:15:03,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:03,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:15:03,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975801166] [2019-12-27 02:15:03,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:15:03,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:03,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:15:03,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:15:03,662 INFO L87 Difference]: Start difference. First operand 4060 states and 12832 transitions. Second operand 3 states. [2019-12-27 02:15:03,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:03,714 INFO L93 Difference]: Finished difference Result 4059 states and 12830 transitions. [2019-12-27 02:15:03,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:15:03,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-12-27 02:15:03,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:03,721 INFO L225 Difference]: With dead ends: 4059 [2019-12-27 02:15:03,721 INFO L226 Difference]: Without dead ends: 4059 [2019-12-27 02:15:03,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:15:03,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4059 states. [2019-12-27 02:15:03,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4059 to 3602. [2019-12-27 02:15:03,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3602 states. [2019-12-27 02:15:03,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3602 states to 3602 states and 11536 transitions. [2019-12-27 02:15:03,769 INFO L78 Accepts]: Start accepts. Automaton has 3602 states and 11536 transitions. Word has length 74 [2019-12-27 02:15:03,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:03,769 INFO L462 AbstractCegarLoop]: Abstraction has 3602 states and 11536 transitions. [2019-12-27 02:15:03,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:15:03,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3602 states and 11536 transitions. [2019-12-27 02:15:03,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 02:15:03,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:03,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:03,777 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:03,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:03,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1481768599, now seen corresponding path program 1 times [2019-12-27 02:15:03,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:03,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140774901] [2019-12-27 02:15:03,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:03,945 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 02:15:03,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140774901] [2019-12-27 02:15:03,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:03,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:15:03,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667118493] [2019-12-27 02:15:03,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:15:03,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:03,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:15:03,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:15:03,949 INFO L87 Difference]: Start difference. First operand 3602 states and 11536 transitions. Second operand 5 states. [2019-12-27 02:15:04,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:04,082 INFO L93 Difference]: Finished difference Result 7270 states and 21909 transitions. [2019-12-27 02:15:04,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:15:04,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-27 02:15:04,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:04,090 INFO L225 Difference]: With dead ends: 7270 [2019-12-27 02:15:04,090 INFO L226 Difference]: Without dead ends: 2940 [2019-12-27 02:15:04,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:15:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2019-12-27 02:15:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1936. [2019-12-27 02:15:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1936 states. [2019-12-27 02:15:04,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 5209 transitions. [2019-12-27 02:15:04,134 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 5209 transitions. Word has length 75 [2019-12-27 02:15:04,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:04,135 INFO L462 AbstractCegarLoop]: Abstraction has 1936 states and 5209 transitions. [2019-12-27 02:15:04,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:15:04,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 5209 transitions. [2019-12-27 02:15:04,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 02:15:04,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:04,139 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:04,139 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:04,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:04,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1998741429, now seen corresponding path program 2 times [2019-12-27 02:15:04,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:04,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435313705] [2019-12-27 02:15:04,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:04,292 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 02:15:04,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435313705] [2019-12-27 02:15:04,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:04,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:15:04,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513254062] [2019-12-27 02:15:04,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:15:04,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:04,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:15:04,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:15:04,296 INFO L87 Difference]: Start difference. First operand 1936 states and 5209 transitions. Second operand 5 states. [2019-12-27 02:15:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:04,343 INFO L93 Difference]: Finished difference Result 2170 states and 5648 transitions. [2019-12-27 02:15:04,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:15:04,344 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-27 02:15:04,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:04,346 INFO L225 Difference]: With dead ends: 2170 [2019-12-27 02:15:04,346 INFO L226 Difference]: Without dead ends: 1182 [2019-12-27 02:15:04,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:15:04,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2019-12-27 02:15:04,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1182. [2019-12-27 02:15:04,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2019-12-27 02:15:04,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 2736 transitions. [2019-12-27 02:15:04,363 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 2736 transitions. Word has length 75 [2019-12-27 02:15:04,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:04,363 INFO L462 AbstractCegarLoop]: Abstraction has 1182 states and 2736 transitions. [2019-12-27 02:15:04,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:15:04,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 2736 transitions. [2019-12-27 02:15:04,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 02:15:04,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:04,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:04,366 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:04,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:04,366 INFO L82 PathProgramCache]: Analyzing trace with hash -423476261, now seen corresponding path program 3 times [2019-12-27 02:15:04,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:04,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094407816] [2019-12-27 02:15:04,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:04,467 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 02:15:04,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094407816] [2019-12-27 02:15:04,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:04,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:15:04,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445241872] [2019-12-27 02:15:04,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:15:04,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:04,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:15:04,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:15:04,469 INFO L87 Difference]: Start difference. First operand 1182 states and 2736 transitions. Second operand 4 states. [2019-12-27 02:15:04,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:04,575 INFO L93 Difference]: Finished difference Result 2207 states and 5107 transitions. [2019-12-27 02:15:04,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:15:04,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-27 02:15:04,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:04,578 INFO L225 Difference]: With dead ends: 2207 [2019-12-27 02:15:04,579 INFO L226 Difference]: Without dead ends: 2207 [2019-12-27 02:15:04,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:15:04,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2207 states. [2019-12-27 02:15:04,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2207 to 1492. [2019-12-27 02:15:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1492 states. [2019-12-27 02:15:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 3461 transitions. [2019-12-27 02:15:04,604 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 3461 transitions. Word has length 75 [2019-12-27 02:15:04,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:04,604 INFO L462 AbstractCegarLoop]: Abstraction has 1492 states and 3461 transitions. [2019-12-27 02:15:04,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:15:04,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 3461 transitions. [2019-12-27 02:15:04,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 02:15:04,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:04,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:04,608 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:04,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:04,608 INFO L82 PathProgramCache]: Analyzing trace with hash 873355187, now seen corresponding path program 4 times [2019-12-27 02:15:04,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:04,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649596662] [2019-12-27 02:15:04,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:04,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:04,705 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 02:15:04,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649596662] [2019-12-27 02:15:04,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:04,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:15:04,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024530535] [2019-12-27 02:15:04,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:15:04,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:04,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:15:04,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:15:04,711 INFO L87 Difference]: Start difference. First operand 1492 states and 3461 transitions. Second operand 4 states. [2019-12-27 02:15:04,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:04,746 INFO L93 Difference]: Finished difference Result 1722 states and 3896 transitions. [2019-12-27 02:15:04,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:15:04,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-27 02:15:04,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:04,747 INFO L225 Difference]: With dead ends: 1722 [2019-12-27 02:15:04,747 INFO L226 Difference]: Without dead ends: 348 [2019-12-27 02:15:04,748 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 02:15:04,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-12-27 02:15:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2019-12-27 02:15:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-12-27 02:15:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 621 transitions. [2019-12-27 02:15:04,753 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 621 transitions. Word has length 75 [2019-12-27 02:15:04,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:04,753 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 621 transitions. [2019-12-27 02:15:04,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:15:04,753 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 621 transitions. [2019-12-27 02:15:04,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 02:15:04,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:04,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:04,755 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:04,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:04,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1429844161, now seen corresponding path program 5 times [2019-12-27 02:15:04,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:04,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401042439] [2019-12-27 02:15:04,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:04,893 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 02:15:04,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401042439] [2019-12-27 02:15:04,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:04,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:15:04,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696883214] [2019-12-27 02:15:04,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:15:04,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:04,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:15:04,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:15:04,895 INFO L87 Difference]: Start difference. First operand 346 states and 621 transitions. Second operand 6 states. [2019-12-27 02:15:04,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:04,987 INFO L93 Difference]: Finished difference Result 664 states and 1206 transitions. [2019-12-27 02:15:04,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:15:04,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2019-12-27 02:15:04,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:04,988 INFO L225 Difference]: With dead ends: 664 [2019-12-27 02:15:04,988 INFO L226 Difference]: Without dead ends: 343 [2019-12-27 02:15:04,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:15:04,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-12-27 02:15:04,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2019-12-27 02:15:04,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-27 02:15:04,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 616 transitions. [2019-12-27 02:15:04,993 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 616 transitions. Word has length 75 [2019-12-27 02:15:04,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:04,994 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 616 transitions. [2019-12-27 02:15:04,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:15:04,994 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 616 transitions. [2019-12-27 02:15:04,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-27 02:15:04,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:04,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:04,996 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:04,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:04,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1721238743, now seen corresponding path program 1 times [2019-12-27 02:15:04,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:04,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439675614] [2019-12-27 02:15:04,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:05,076 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 02:15:05,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439675614] [2019-12-27 02:15:05,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:05,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:15:05,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001686821] [2019-12-27 02:15:05,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:15:05,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:05,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:15:05,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:15:05,078 INFO L87 Difference]: Start difference. First operand 343 states and 616 transitions. Second operand 3 states. [2019-12-27 02:15:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:05,091 INFO L93 Difference]: Finished difference Result 333 states and 579 transitions. [2019-12-27 02:15:05,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:15:05,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-12-27 02:15:05,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:05,093 INFO L225 Difference]: With dead ends: 333 [2019-12-27 02:15:05,093 INFO L226 Difference]: Without dead ends: 333 [2019-12-27 02:15:05,093 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 02:15:05,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-27 02:15:05,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 271. [2019-12-27 02:15:05,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-12-27 02:15:05,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 460 transitions. [2019-12-27 02:15:05,098 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 460 transitions. Word has length 76 [2019-12-27 02:15:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:05,099 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 460 transitions. [2019-12-27 02:15:05,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:15:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 460 transitions. [2019-12-27 02:15:05,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 02:15:05,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:05,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:05,101 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:05,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:05,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1125574762, now seen corresponding path program 1 times [2019-12-27 02:15:05,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:05,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972702809] [2019-12-27 02:15:05,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:05,822 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 02:15:05,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972702809] [2019-12-27 02:15:05,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:05,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-27 02:15:05,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097653619] [2019-12-27 02:15:05,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 02:15:05,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:05,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 02:15:05,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-12-27 02:15:05,826 INFO L87 Difference]: Start difference. First operand 271 states and 460 transitions. Second operand 22 states. [2019-12-27 02:15:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:09,338 INFO L93 Difference]: Finished difference Result 897 states and 1619 transitions. [2019-12-27 02:15:09,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 02:15:09,339 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 77 [2019-12-27 02:15:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:09,340 INFO L225 Difference]: With dead ends: 897 [2019-12-27 02:15:09,340 INFO L226 Difference]: Without dead ends: 868 [2019-12-27 02:15:09,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=354, Invalid=2508, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 02:15:09,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-12-27 02:15:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 406. [2019-12-27 02:15:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-27 02:15:09,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 693 transitions. [2019-12-27 02:15:09,347 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 693 transitions. Word has length 77 [2019-12-27 02:15:09,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:09,347 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 693 transitions. [2019-12-27 02:15:09,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 02:15:09,348 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 693 transitions. [2019-12-27 02:15:09,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 02:15:09,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:09,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:09,349 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:09,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:09,349 INFO L82 PathProgramCache]: Analyzing trace with hash 90839542, now seen corresponding path program 2 times [2019-12-27 02:15:09,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:09,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191086448] [2019-12-27 02:15:09,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:09,595 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 02:15:09,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191086448] [2019-12-27 02:15:09,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:09,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 02:15:09,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934957052] [2019-12-27 02:15:09,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 02:15:09,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:09,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 02:15:09,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:15:09,597 INFO L87 Difference]: Start difference. First operand 406 states and 693 transitions. Second operand 13 states. [2019-12-27 02:15:10,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:10,241 INFO L93 Difference]: Finished difference Result 736 states and 1275 transitions. [2019-12-27 02:15:10,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 02:15:10,241 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2019-12-27 02:15:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:10,242 INFO L225 Difference]: With dead ends: 736 [2019-12-27 02:15:10,243 INFO L226 Difference]: Without dead ends: 707 [2019-12-27 02:15:10,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-12-27 02:15:10,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-12-27 02:15:10,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 482. [2019-12-27 02:15:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2019-12-27 02:15:10,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 840 transitions. [2019-12-27 02:15:10,249 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 840 transitions. Word has length 77 [2019-12-27 02:15:10,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:10,249 INFO L462 AbstractCegarLoop]: Abstraction has 482 states and 840 transitions. [2019-12-27 02:15:10,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 02:15:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 840 transitions. [2019-12-27 02:15:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 02:15:10,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:10,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:10,250 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:10,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:10,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1785649146, now seen corresponding path program 3 times [2019-12-27 02:15:10,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:10,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113961410] [2019-12-27 02:15:10,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:10,547 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 02:15:10,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113961410] [2019-12-27 02:15:10,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:10,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 02:15:10,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296109982] [2019-12-27 02:15:10,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 02:15:10,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:10,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 02:15:10,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:15:10,549 INFO L87 Difference]: Start difference. First operand 482 states and 840 transitions. Second operand 15 states. [2019-12-27 02:15:11,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:11,499 INFO L93 Difference]: Finished difference Result 772 states and 1339 transitions. [2019-12-27 02:15:11,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:15:11,500 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 77 [2019-12-27 02:15:11,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:11,501 INFO L225 Difference]: With dead ends: 772 [2019-12-27 02:15:11,501 INFO L226 Difference]: Without dead ends: 741 [2019-12-27 02:15:11,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2019-12-27 02:15:11,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-12-27 02:15:11,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 480. [2019-12-27 02:15:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-12-27 02:15:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 836 transitions. [2019-12-27 02:15:11,509 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 836 transitions. Word has length 77 [2019-12-27 02:15:11,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:11,509 INFO L462 AbstractCegarLoop]: Abstraction has 480 states and 836 transitions. [2019-12-27 02:15:11,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 02:15:11,509 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 836 transitions. [2019-12-27 02:15:11,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 02:15:11,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:11,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:11,510 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:11,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:11,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1455854044, now seen corresponding path program 4 times [2019-12-27 02:15:11,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:11,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092448552] [2019-12-27 02:15:11,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:15:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:15:11,636 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:15:11,636 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:15:11,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1075] [1075] ULTIMATE.startENTRY-->L839: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t825~0.base_24|) 0) (= 0 v_~z$flush_delayed~0_273) (= v_~z$r_buff0_thd1~0_51 0) (= 0 v_~z$r_buff1_thd3~0_297) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t825~0.base_24|) (= v_~z$r_buff1_thd1~0_205 0) (= 0 v_~z$r_buff1_thd4~0_383) (= v_~z$r_buff0_thd0~0_482 0) (= v_~main$tmp_guard0~0_25 0) (= v_~z$w_buff1~0_315 0) (= 0 v_~__unbuffered_p3_EBX~0_63) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$r_buff0_thd4~0_518) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t825~0.base_24| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t825~0.base_24|) |v_ULTIMATE.start_main_~#t825~0.offset_19| 0)) |v_#memory_int_27|) (= 0 v_~__unbuffered_p3_EAX~0_73) (= v_~y~0_126 0) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff0~0_383 0) (= 0 v_~x~0_106) (= 0 v_~z$mem_tmp~0_243) (= v_~z$r_buff0_thd2~0_50 0) (= v_~z~0_295 0) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~z$r_buff0_thd3~0_133) (< 0 |v_#StackHeapBarrier_20|) (= v_~weak$$choice2~0_323 0) (= v_~main$tmp_guard1~0_64 0) (= v_~__unbuffered_cnt~0_220 0) (= v_~z$w_buff1_used~0_723 0) (= 0 v_~weak$$choice0~0_232) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t825~0.base_24| 4)) (= v_~z$w_buff0_used~0_1076 0) (= v_~a~0_53 0) (= v_~z$r_buff1_thd2~0_205 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t825~0.base_24| 1)) (= v_~z$r_buff1_thd0~0_494 0) (= |v_ULTIMATE.start_main_~#t825~0.offset_19| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t825~0.offset=|v_ULTIMATE.start_main_~#t825~0.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_76|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_94|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_52|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_44|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_42|, ~a~0=v_~a~0_53, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_95|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_482, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_518, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ULTIMATE.start_main_~#t828~0.base=|v_ULTIMATE.start_main_~#t828~0.base_16|, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet48=|v_ULTIMATE.start_main_#t~nondet48_60|, ~z$mem_tmp~0=v_~z$mem_tmp~0_243, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t827~0.offset=|v_ULTIMATE.start_main_~#t827~0.offset_18|, ULTIMATE.start_main_~#t825~0.base=|v_ULTIMATE.start_main_~#t825~0.base_24|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_34|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_723, ~z$flush_delayed~0=v_~z$flush_delayed~0_273, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_139|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_60|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_226|, ~weak$$choice0~0=v_~weak$$choice0~0_232, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_154|, ULTIMATE.start_main_~#t828~0.offset=|v_ULTIMATE.start_main_~#t828~0.offset_14|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_205, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_133, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_220, ~x~0=v_~x~0_106, ULTIMATE.start_main_~#t826~0.base=|v_ULTIMATE.start_main_~#t826~0.base_23|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_383, ~z$read_delayed~0=v_~z$read_delayed~0_6, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~z$w_buff1~0=v_~z$w_buff1~0_315, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_64, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_83|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_38|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_79|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_224|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ULTIMATE.start_main_~#t826~0.offset=|v_ULTIMATE.start_main_~#t826~0.offset_18|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_494, ULTIMATE.start_main_#t~nondet49=|v_ULTIMATE.start_main_#t~nondet49_60|, ~y~0=v_~y~0_126, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_50, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1076, ~z$w_buff0~0=v_~z$w_buff0~0_383, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_297, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_70|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_41|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_63, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_133|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_53|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_147|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_55|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_295, ~weak$$choice2~0=v_~weak$$choice2~0_323, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_51, ULTIMATE.start_main_~#t827~0.base=|v_ULTIMATE.start_main_~#t827~0.base_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t825~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t828~0.base, #length, ULTIMATE.start_main_#t~nondet48, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t827~0.offset, ULTIMATE.start_main_~#t825~0.base, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t828~0.offset, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t826~0.base, ~z$r_buff1_thd4~0, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_~#t826~0.offset, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_#t~ite70, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet49, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet40, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t827~0.base] because there is no mapped edge [2019-12-27 02:15:11,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L839-1-->L841: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t826~0.base_10|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t826~0.base_10| 4) |v_#length_17|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t826~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t826~0.base_10| 0)) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t826~0.base_10|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t826~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t826~0.base_10|) |v_ULTIMATE.start_main_~#t826~0.offset_9| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t826~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t826~0.offset=|v_ULTIMATE.start_main_~#t826~0.offset_9|, ULTIMATE.start_main_~#t826~0.base=|v_ULTIMATE.start_main_~#t826~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t826~0.offset, ULTIMATE.start_main_~#t826~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 02:15:11,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L841-1-->L843: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t827~0.base_12| 1) |v_#valid_46|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t827~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t827~0.base_12|) |v_ULTIMATE.start_main_~#t827~0.offset_10| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t827~0.base_12|) (= |v_ULTIMATE.start_main_~#t827~0.offset_10| 0) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t827~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t827~0.base_12|)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t827~0.base_12| 4) |v_#length_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t827~0.offset=|v_ULTIMATE.start_main_~#t827~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t827~0.base=|v_ULTIMATE.start_main_~#t827~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t827~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t827~0.base] because there is no mapped edge [2019-12-27 02:15:11,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] L843-1-->L845: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t828~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t828~0.base_13|) |v_ULTIMATE.start_main_~#t828~0.offset_11| 3)) |v_#memory_int_21|) (= |v_#valid_52| (store |v_#valid_53| |v_ULTIMATE.start_main_~#t828~0.base_13| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t828~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t828~0.base_13| 0)) (= 0 (select |v_#valid_53| |v_ULTIMATE.start_main_~#t828~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t828~0.offset_11|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t828~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t828~0.offset=|v_ULTIMATE.start_main_~#t828~0.offset_11|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t828~0.base=|v_ULTIMATE.start_main_~#t828~0.base_13|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t828~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t828~0.base, #length] because there is no mapped edge [2019-12-27 02:15:11,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_6| 1) (= (mod v_~z$w_buff1_used~0_154 256) 0) (= v_~z$w_buff0~0_62 v_~z$w_buff1~0_45) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_6| v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8) (= v_~z$w_buff0_used~0_302 v_~z$w_buff1_used~0_154) (= 2 v_~z$w_buff0~0_61) (= v_P3Thread1of1ForFork3_~arg.offset_6 |v_P3Thread1of1ForFork3_#in~arg.offset_6|) (= v_P3Thread1of1ForFork3_~arg.base_6 |v_P3Thread1of1ForFork3_#in~arg.base_6|) (= v_~z$w_buff0_used~0_301 1)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_302, ~z$w_buff0~0=v_~z$w_buff0~0_62, P3Thread1of1ForFork3_#in~arg.offset=|v_P3Thread1of1ForFork3_#in~arg.offset_6|, P3Thread1of1ForFork3_#in~arg.base=|v_P3Thread1of1ForFork3_#in~arg.base_6|} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_301, ~z$w_buff0~0=v_~z$w_buff0~0_61, P3Thread1of1ForFork3_~arg.offset=v_P3Thread1of1ForFork3_~arg.offset_6, P3Thread1of1ForFork3_#in~arg.offset=|v_P3Thread1of1ForFork3_#in~arg.offset_6|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_154, ~z$w_buff1~0=v_~z$w_buff1~0_45, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_6|, P3Thread1of1ForFork3_~arg.base=v_P3Thread1of1ForFork3_~arg.base_6, P3Thread1of1ForFork3_#in~arg.base=|v_P3Thread1of1ForFork3_#in~arg.base_6|} AuxVars[] AssignedVars[P3Thread1of1ForFork3___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P3Thread1of1ForFork3_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression, P3Thread1of1ForFork3_~arg.base] because there is no mapped edge [2019-12-27 02:15:11,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L801-2-->L801-5: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd4~0_In1625819677 256) 0)) (.cse0 (= |P3Thread1of1ForFork3_#t~ite11_Out1625819677| |P3Thread1of1ForFork3_#t~ite12_Out1625819677|)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1625819677 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P3Thread1of1ForFork3_#t~ite11_Out1625819677| ~z$w_buff1~0_In1625819677)) (and (not .cse2) .cse0 (not .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out1625819677| ~z$w_buff0~0_In1625819677)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1625819677, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1625819677, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1625819677, ~z$w_buff1~0=~z$w_buff1~0_In1625819677} OutVars{~z$w_buff0~0=~z$w_buff0~0_In1625819677, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1625819677, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out1625819677|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1625819677, ~z$w_buff1~0=~z$w_buff1~0_In1625819677, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1625819677|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12, P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 02:15:11,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L806-->L807: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_42 256))) (= v_~z$r_buff0_thd4~0_99 v_~z$r_buff0_thd4~0_100)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_42} OutVars{P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_9|, P3Thread1of1ForFork3_#t~ite26=|v_P3Thread1of1ForFork3_#t~ite26_7|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_11|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_99, ~weak$$choice2~0=v_~weak$$choice2~0_42} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite27, P3Thread1of1ForFork3_#t~ite26, P3Thread1of1ForFork3_#t~ite25, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 02:15:11,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In56480184 256) 0))) (or (and .cse0 (= |P3Thread1of1ForFork3_#t~ite31_Out56480184| ~z~0_In56480184)) (and (not .cse0) (= ~z$mem_tmp~0_In56480184 |P3Thread1of1ForFork3_#t~ite31_Out56480184|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In56480184, ~z$flush_delayed~0=~z$flush_delayed~0_In56480184, ~z~0=~z~0_In56480184} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In56480184, ~z$flush_delayed~0=~z$flush_delayed~0_In56480184, ~z~0=~z~0_In56480184, P3Thread1of1ForFork3_#t~ite31=|P3Thread1of1ForFork3_#t~ite31_Out56480184|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 02:15:11,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~a~0_21 1) (= v_~x~0_33 1) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_P0Thread1of1ForFork0_~arg.base_18 |v_P0Thread1of1ForFork0_#in~arg.base_18|) (= v_P0Thread1of1ForFork0_~arg.offset_18 |v_P0Thread1of1ForFork0_#in~arg.offset_18|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_18|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} OutVars{~a~0=v_~a~0_21, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_18|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_18|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_18, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_18} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 02:15:11,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1054] [1054] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_54 2) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y~0_83 1) (= v_~__unbuffered_cnt~0_140 (+ v_~__unbuffered_cnt~0_141 1)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_14| v_P1Thread1of1ForFork1_~arg.offset_14) (= v_P1Thread1of1ForFork1_~arg.base_14 |v_P1Thread1of1ForFork1_#in~arg.base_14|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_14, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_14, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~y~0=v_~y~0_83, ~x~0=v_~x~0_54, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 02:15:11,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L770-2-->L770-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In1551248241 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1551248241 256))) (.cse2 (= |P2Thread1of1ForFork2_#t~ite3_Out1551248241| |P2Thread1of1ForFork2_#t~ite4_Out1551248241|))) (or (and (= ~z$w_buff1~0_In1551248241 |P2Thread1of1ForFork2_#t~ite3_Out1551248241|) (not .cse0) (not .cse1) .cse2) (and (= ~z~0_In1551248241 |P2Thread1of1ForFork2_#t~ite3_Out1551248241|) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1551248241, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1551248241, ~z$w_buff1~0=~z$w_buff1~0_In1551248241, ~z~0=~z~0_In1551248241} OutVars{P2Thread1of1ForFork2_#t~ite4=|P2Thread1of1ForFork2_#t~ite4_Out1551248241|, P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out1551248241|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1551248241, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1551248241, ~z$w_buff1~0=~z$w_buff1~0_In1551248241, ~z~0=~z~0_In1551248241} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 02:15:11,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In407462679 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In407462679 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite5_Out407462679| ~z$w_buff0_used~0_In407462679)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out407462679| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In407462679, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In407462679} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out407462679|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In407462679, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In407462679} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 02:15:11,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In326153251 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In326153251 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In326153251 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In326153251 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out326153251| ~z$w_buff1_used~0_In326153251) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite6_Out326153251| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In326153251, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In326153251, ~z$w_buff1_used~0=~z$w_buff1_used~0_In326153251, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In326153251} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out326153251|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In326153251, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In326153251, ~z$w_buff1_used~0=~z$w_buff1_used~0_In326153251, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In326153251} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 02:15:11,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-945616610 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-945616610 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out-945616610|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-945616610| ~z$r_buff0_thd3~0_In-945616610)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-945616610, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-945616610} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-945616610, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-945616610, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-945616610|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 02:15:11,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1750644884 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1750644884 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1750644884 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1750644884 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite8_Out-1750644884| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite8_Out-1750644884| ~z$r_buff1_thd3~0_In-1750644884) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1750644884, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1750644884, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1750644884, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1750644884} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1750644884, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1750644884, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1750644884, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1750644884, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1750644884|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 02:15:11,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1050] [1050] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= |v_P2Thread1of1ForFork2_#t~ite8_54| v_~z$r_buff1_thd3~0_177) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_54|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_177, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_53|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 02:15:11,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In453596254 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In453596254 256)))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork3_#t~ite34_Out453596254|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In453596254 |P3Thread1of1ForFork3_#t~ite34_Out453596254|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In453596254, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In453596254} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In453596254, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In453596254, P3Thread1of1ForFork3_#t~ite34=|P3Thread1of1ForFork3_#t~ite34_Out453596254|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite34] because there is no mapped edge [2019-12-27 02:15:11,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L818-->L818-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1553824145 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-1553824145 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1553824145 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1553824145 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite35_Out-1553824145| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-1553824145 |P3Thread1of1ForFork3_#t~ite35_Out-1553824145|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1553824145, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1553824145, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1553824145, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1553824145} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1553824145, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1553824145, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1553824145, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1553824145, P3Thread1of1ForFork3_#t~ite35=|P3Thread1of1ForFork3_#t~ite35_Out-1553824145|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite35] because there is no mapped edge [2019-12-27 02:15:11,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L819-->L820: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1122869687 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1122869687 256)))) (or (and (= 0 ~z$r_buff0_thd4~0_Out1122869687) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out1122869687 ~z$r_buff0_thd4~0_In1122869687) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1122869687, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1122869687} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1122869687, P3Thread1of1ForFork3_#t~ite36=|P3Thread1of1ForFork3_#t~ite36_Out1122869687|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1122869687} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite36, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 02:15:11,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-308768082 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-308768082 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-308768082 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In-308768082 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite37_Out-308768082| ~z$r_buff1_thd4~0_In-308768082) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite37_Out-308768082| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-308768082, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-308768082, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-308768082, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-308768082} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-308768082, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-308768082, P3Thread1of1ForFork3_#t~ite37=|P3Thread1of1ForFork3_#t~ite37_Out-308768082|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-308768082, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-308768082} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite37] because there is no mapped edge [2019-12-27 02:15:11,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1052] [1052] L820-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite37_52| v_~z$r_buff1_thd4~0_255) (= v_~__unbuffered_cnt~0_134 (+ v_~__unbuffered_cnt~0_135 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_135} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_255, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_51|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite37, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 02:15:11,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L845-1-->L851: Formula: (and (= 4 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:15:11,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L851-2-->L851-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-904273134 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-904273134 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-904273134| ~z$w_buff1~0_In-904273134) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out-904273134| ~z~0_In-904273134) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-904273134, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-904273134, ~z$w_buff1~0=~z$w_buff1~0_In-904273134, ~z~0=~z~0_In-904273134} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-904273134, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-904273134, ~z$w_buff1~0=~z$w_buff1~0_In-904273134, ~z~0=~z~0_In-904273134, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-904273134|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:15:11,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] L851-4-->L852: Formula: (= v_~z~0_85 |v_ULTIMATE.start_main_#t~ite42_10|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|} OutVars{~z~0=v_~z~0_85, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[~z~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:15:11,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L852-->L852-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1783868042 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1783868042 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1783868042| ~z$w_buff0_used~0_In1783868042)) (and (= |ULTIMATE.start_main_#t~ite44_Out1783868042| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1783868042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1783868042} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1783868042, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1783868042, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1783868042|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 02:15:11,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L853-->L853-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1690254871 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1690254871 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1690254871 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1690254871 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1690254871|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-1690254871 |ULTIMATE.start_main_#t~ite45_Out-1690254871|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1690254871, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1690254871, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1690254871, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1690254871} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1690254871, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1690254871, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1690254871, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1690254871, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1690254871|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 02:15:11,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L854-->L854-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In916724863 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In916724863 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite46_Out916724863|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In916724863 |ULTIMATE.start_main_#t~ite46_Out916724863|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In916724863, ~z$w_buff0_used~0=~z$w_buff0_used~0_In916724863} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In916724863, ~z$w_buff0_used~0=~z$w_buff0_used~0_In916724863, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out916724863|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 02:15:11,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1014] [1014] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1916121339 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1916121339 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1916121339 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1916121339 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-1916121339| ~z$r_buff1_thd0~0_In-1916121339) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite47_Out-1916121339| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1916121339, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1916121339, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1916121339, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1916121339} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1916121339, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1916121339, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1916121339, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1916121339|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1916121339} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 02:15:11,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L870-->L870-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1900226219 256)))) (or (and (not .cse0) (= ~z$mem_tmp~0_In1900226219 |ULTIMATE.start_main_#t~ite70_Out1900226219|)) (and .cse0 (= ~z~0_In1900226219 |ULTIMATE.start_main_#t~ite70_Out1900226219|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1900226219, ~z$flush_delayed~0=~z$flush_delayed~0_In1900226219, ~z~0=~z~0_In1900226219} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1900226219, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out1900226219|, ~z$flush_delayed~0=~z$flush_delayed~0_In1900226219, ~z~0=~z~0_In1900226219} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70] because there is no mapped edge [2019-12-27 02:15:11,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1070] [1070] L870-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= 0 v_~z$flush_delayed~0_270) (= v_~z~0_292 |v_ULTIMATE.start_main_#t~ite70_48|) (= (mod v_~main$tmp_guard1~0_61 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_48|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_270, ~z~0=v_~z~0_292, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite70, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:15:11,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:15:11 BasicIcfg [2019-12-27 02:15:11,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:15:11,819 INFO L168 Benchmark]: Toolchain (without parser) took 80072.55 ms. Allocated memory was 145.8 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 101.2 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 02:15:11,820 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 02:15:11,821 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.15 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.7 MB in the beginning and 155.0 MB in the end (delta: -54.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-12-27 02:15:11,821 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.28 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 151.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 02:15:11,822 INFO L168 Benchmark]: Boogie Preprocessor took 43.68 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 149.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:15:11,823 INFO L168 Benchmark]: RCFGBuilder took 1025.46 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 149.0 MB in the beginning and 202.6 MB in the end (delta: -53.5 MB). Peak memory consumption was 65.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:15:11,823 INFO L168 Benchmark]: TraceAbstraction took 78137.11 ms. Allocated memory was 235.4 MB in the beginning and 3.6 GB in the end (delta: 3.3 GB). Free memory was 202.6 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 02:15:11,827 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.48 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 785.15 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.7 MB in the beginning and 155.0 MB in the end (delta: -54.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.28 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 151.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.68 ms. Allocated memory is still 202.9 MB. Free memory was 151.7 MB in the beginning and 149.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1025.46 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 149.0 MB in the beginning and 202.6 MB in the end (delta: -53.5 MB). Peak memory consumption was 65.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 78137.11 ms. Allocated memory was 235.4 MB in the beginning and 3.6 GB in the end (delta: 3.3 GB). Free memory was 202.6 MB in the beginning and 1.2 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.3s, 221 ProgramPointsBefore, 122 ProgramPointsAfterwards, 270 TransitionsBefore, 142 TransitionsAfterwards, 28796 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 34 ChoiceCompositions, 10428 VarBasedMoverChecksPositive, 374 VarBasedMoverChecksNegative, 122 SemBasedMoverChecksPositive, 390 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 0 MoverChecksTotal, 145015 CheckedPairsTotal, 133 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L839] FCALL, FORK 0 pthread_create(&t825, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L841] FCALL, FORK 0 pthread_create(&t826, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L843] FCALL, FORK 0 pthread_create(&t827, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L845] FCALL, FORK 0 pthread_create(&t828, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L789] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L790] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L791] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L792] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L793] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L794] 4 z$r_buff0_thd4 = (_Bool)1 [L797] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 4 z$flush_delayed = weak$$choice2 [L800] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L802] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L803] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L804] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L805] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L808] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z = z$flush_delayed ? z$mem_tmp : z [L810] 4 z$flush_delayed = (_Bool)0 [L813] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 3 y = 2 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=10, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 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) [L770] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=10, weak$$choice2=1, x=2, y=2, z=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L818] 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 [L851] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=10, weak$$choice2=1, x=2, y=2, z=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L853] 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 [L854] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L855] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 z$flush_delayed = weak$$choice2 [L861] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L863] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L863] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L864] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L865] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L866] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L868] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=2, z=2, z$flush_delayed=1, z$mem_tmp=2, 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=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 209 locations, 2 error locations. Result: UNSAFE, OverallTime: 77.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2906 SDtfs, 3376 SDslu, 8157 SDs, 0 SdLazy, 4473 SolverSat, 215 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 29 SyntacticMatches, 10 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160294occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 35.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 10370 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1082 NumberOfCodeBlocks, 1082 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 987 ConstructedInterpolants, 0 QuantifiedInterpolants, 303789 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...