/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/mix036_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:20:51,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:20:51,584 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:20:51,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:20:51,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:20:51,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:20:51,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:20:51,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:20:51,617 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:20:51,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:20:51,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:20:51,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:20:51,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:20:51,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:20:51,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:20:51,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:20:51,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:20:51,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:20:51,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:20:51,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:20:51,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:20:51,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:20:51,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:20:51,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:20:51,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:20:51,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:20:51,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:20:51,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:20:51,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:20:51,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:20:51,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:20:51,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:20:51,646 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:20:51,647 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:20:51,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:20:51,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:20:51,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:20:51,649 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:20:51,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:20:51,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:20:51,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:20:51,654 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:20:51,676 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:20:51,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:20:51,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:20:51,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:20:51,679 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:20:51,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:20:51,680 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:20:51,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:20:51,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:20:51,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:20:51,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:20:51,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:20:51,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:20:51,683 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:20:51,683 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:20:51,683 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:20:51,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:20:51,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:20:51,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:20:51,684 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:20:51,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:20:51,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:20:51,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:20:51,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:20:51,685 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:20:51,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:20:51,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:20:51,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:20:51,686 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:20:51,973 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:20:51,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:20:51,990 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:20:51,992 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:20:51,992 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:20:51,993 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_tso.opt.i [2019-12-27 02:20:52,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aecd92388/abee3d756a254589a1bfebe6e1bf316e/FLAGc3069d458 [2019-12-27 02:20:52,622 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:20:52,623 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_tso.opt.i [2019-12-27 02:20:52,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aecd92388/abee3d756a254589a1bfebe6e1bf316e/FLAGc3069d458 [2019-12-27 02:20:52,921 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aecd92388/abee3d756a254589a1bfebe6e1bf316e [2019-12-27 02:20:52,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:20:52,931 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:20:52,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:20:52,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:20:52,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:20:52,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:20:52" (1/1) ... [2019-12-27 02:20:52,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@753835ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:20:52, skipping insertion in model container [2019-12-27 02:20:52,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:20:52" (1/1) ... [2019-12-27 02:20:52,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:20:53,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:20:53,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:20:53,489 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:20:53,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:20:53,648 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:20:53,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:20:53 WrapperNode [2019-12-27 02:20:53,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:20:53,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:20:53,650 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:20:53,650 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:20:53,659 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:20:53" (1/1) ... [2019-12-27 02:20:53,679 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:20:53" (1/1) ... [2019-12-27 02:20:53,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:20:53,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:20:53,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:20:53,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:20:53,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:20:53" (1/1) ... [2019-12-27 02:20:53,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:20:53" (1/1) ... [2019-12-27 02:20:53,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:20:53" (1/1) ... [2019-12-27 02:20:53,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:20:53" (1/1) ... [2019-12-27 02:20:53,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:20:53" (1/1) ... [2019-12-27 02:20:53,743 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:20:53" (1/1) ... [2019-12-27 02:20:53,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:20:53" (1/1) ... [2019-12-27 02:20:53,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:20:53,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:20:53,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:20:53,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:20:53,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:20:53" (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:20:53,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:20:53,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:20:53,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:20:53,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:20:53,833 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:20:53,833 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:20:53,834 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:20:53,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:20:53,834 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:20:53,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:20:53,834 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 02:20:53,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 02:20:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:20:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:20:53,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:20:53,837 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:20:54,561 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:20:54,561 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:20:54,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:20:54 BoogieIcfgContainer [2019-12-27 02:20:54,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:20:54,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:20:54,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:20:54,568 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:20:54,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:20:52" (1/3) ... [2019-12-27 02:20:54,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24774d65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:20:54, skipping insertion in model container [2019-12-27 02:20:54,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:20:53" (2/3) ... [2019-12-27 02:20:54,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24774d65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:20:54, skipping insertion in model container [2019-12-27 02:20:54,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:20:54" (3/3) ... [2019-12-27 02:20:54,572 INFO L109 eAbstractionObserver]: Analyzing ICFG mix036_tso.opt.i [2019-12-27 02:20:54,581 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:20:54,581 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:20:54,589 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:20:54,590 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:20:54,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,632 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,632 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,633 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,634 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,634 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,634 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,635 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,637 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,637 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,676 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,677 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,682 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,692 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,692 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,692 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,692 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,693 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,696 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,697 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,698 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,698 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,698 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,698 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,698 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,700 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,700 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,700 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,701 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,701 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,701 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,701 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,701 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,702 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,702 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,702 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,702 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,702 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,703 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,703 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,703 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,703 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,703 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,703 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,704 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,704 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,704 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,711 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,711 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,716 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,717 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,723 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,723 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,723 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,725 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,725 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,725 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,727 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,728 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:20:54,743 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 02:20:54,765 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:20:54,766 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:20:54,766 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:20:54,766 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:20:54,766 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:20:54,766 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:20:54,766 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:20:54,766 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:20:54,786 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 193 transitions [2019-12-27 02:20:54,788 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 171 places, 193 transitions [2019-12-27 02:20:54,891 INFO L132 PetriNetUnfolder]: 35/189 cut-off events. [2019-12-27 02:20:54,891 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:20:54,911 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 189 events. 35/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 355 event pairs. 0/152 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 02:20:54,937 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 171 places, 193 transitions [2019-12-27 02:20:54,989 INFO L132 PetriNetUnfolder]: 35/189 cut-off events. [2019-12-27 02:20:54,989 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:20:54,995 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 189 events. 35/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 355 event pairs. 0/152 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-27 02:20:55,011 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-27 02:20:55,012 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:20:59,576 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-27 02:21:00,385 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-27 02:21:00,535 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-27 02:21:00,589 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48496 [2019-12-27 02:21:00,589 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-27 02:21:00,593 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 87 transitions [2019-12-27 02:21:02,206 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 26302 states. [2019-12-27 02:21:02,208 INFO L276 IsEmpty]: Start isEmpty. Operand 26302 states. [2019-12-27 02:21:02,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 02:21:02,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:02,216 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:02,216 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:02,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:02,221 INFO L82 PathProgramCache]: Analyzing trace with hash -887935004, now seen corresponding path program 1 times [2019-12-27 02:21:02,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:02,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035867829] [2019-12-27 02:21:02,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:02,664 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:21:02,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035867829] [2019-12-27 02:21:02,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:02,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:21:02,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890738659] [2019-12-27 02:21:02,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:21:02,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:02,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:21:02,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:02,698 INFO L87 Difference]: Start difference. First operand 26302 states. Second operand 3 states. [2019-12-27 02:21:03,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:03,325 INFO L93 Difference]: Finished difference Result 25630 states and 112008 transitions. [2019-12-27 02:21:03,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:21:03,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 02:21:03,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:03,560 INFO L225 Difference]: With dead ends: 25630 [2019-12-27 02:21:03,560 INFO L226 Difference]: Without dead ends: 24142 [2019-12-27 02:21:03,561 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:21:04,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24142 states. [2019-12-27 02:21:05,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24142 to 24142. [2019-12-27 02:21:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24142 states. [2019-12-27 02:21:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24142 states to 24142 states and 105356 transitions. [2019-12-27 02:21:05,837 INFO L78 Accepts]: Start accepts. Automaton has 24142 states and 105356 transitions. Word has length 9 [2019-12-27 02:21:05,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:05,839 INFO L462 AbstractCegarLoop]: Abstraction has 24142 states and 105356 transitions. [2019-12-27 02:21:05,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:21:05,839 INFO L276 IsEmpty]: Start isEmpty. Operand 24142 states and 105356 transitions. [2019-12-27 02:21:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:21:05,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:05,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:05,847 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:05,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1247749362, now seen corresponding path program 1 times [2019-12-27 02:21:05,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:05,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949368179] [2019-12-27 02:21:05,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:05,929 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:21:05,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949368179] [2019-12-27 02:21:05,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:05,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:21:05,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415778008] [2019-12-27 02:21:05,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:21:05,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:05,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:21:05,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:05,933 INFO L87 Difference]: Start difference. First operand 24142 states and 105356 transitions. Second operand 3 states. [2019-12-27 02:21:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:06,291 INFO L93 Difference]: Finished difference Result 19320 states and 78413 transitions. [2019-12-27 02:21:06,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:21:06,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 02:21:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:06,386 INFO L225 Difference]: With dead ends: 19320 [2019-12-27 02:21:06,386 INFO L226 Difference]: Without dead ends: 19320 [2019-12-27 02:21:06,390 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:21:07,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19320 states. [2019-12-27 02:21:08,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19320 to 19320. [2019-12-27 02:21:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19320 states. [2019-12-27 02:21:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19320 states to 19320 states and 78413 transitions. [2019-12-27 02:21:08,374 INFO L78 Accepts]: Start accepts. Automaton has 19320 states and 78413 transitions. Word has length 15 [2019-12-27 02:21:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:08,375 INFO L462 AbstractCegarLoop]: Abstraction has 19320 states and 78413 transitions. [2019-12-27 02:21:08,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:21:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 19320 states and 78413 transitions. [2019-12-27 02:21:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:21:08,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:08,377 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:21:08,378 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:08,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:08,378 INFO L82 PathProgramCache]: Analyzing trace with hash -321510213, now seen corresponding path program 1 times [2019-12-27 02:21:08,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:08,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560743491] [2019-12-27 02:21:08,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:08,424 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:21:08,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560743491] [2019-12-27 02:21:08,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:08,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:21:08,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451191313] [2019-12-27 02:21:08,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:21:08,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:08,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:21:08,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:21:08,427 INFO L87 Difference]: Start difference. First operand 19320 states and 78413 transitions. Second operand 4 states. [2019-12-27 02:21:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:08,500 INFO L93 Difference]: Finished difference Result 8957 states and 30876 transitions. [2019-12-27 02:21:08,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:21:08,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 02:21:08,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:08,533 INFO L225 Difference]: With dead ends: 8957 [2019-12-27 02:21:08,533 INFO L226 Difference]: Without dead ends: 8957 [2019-12-27 02:21:08,533 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:21:08,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8957 states. [2019-12-27 02:21:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8957 to 8957. [2019-12-27 02:21:09,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8957 states. [2019-12-27 02:21:09,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8957 states to 8957 states and 30876 transitions. [2019-12-27 02:21:09,093 INFO L78 Accepts]: Start accepts. Automaton has 8957 states and 30876 transitions. Word has length 16 [2019-12-27 02:21:09,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:09,094 INFO L462 AbstractCegarLoop]: Abstraction has 8957 states and 30876 transitions. [2019-12-27 02:21:09,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:21:09,094 INFO L276 IsEmpty]: Start isEmpty. Operand 8957 states and 30876 transitions. [2019-12-27 02:21:09,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 02:21:09,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:09,097 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:21:09,097 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:09,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:09,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1192067329, now seen corresponding path program 1 times [2019-12-27 02:21:09,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:09,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93311256] [2019-12-27 02:21:09,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:09,155 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:21:09,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93311256] [2019-12-27 02:21:09,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:09,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:21:09,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586773204] [2019-12-27 02:21:09,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:21:09,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:09,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:21:09,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:21:09,157 INFO L87 Difference]: Start difference. First operand 8957 states and 30876 transitions. Second operand 5 states. [2019-12-27 02:21:09,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:09,231 INFO L93 Difference]: Finished difference Result 2671 states and 8332 transitions. [2019-12-27 02:21:09,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:21:09,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 02:21:09,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:09,243 INFO L225 Difference]: With dead ends: 2671 [2019-12-27 02:21:09,243 INFO L226 Difference]: Without dead ends: 2671 [2019-12-27 02:21:09,244 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:21:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2019-12-27 02:21:09,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 2671. [2019-12-27 02:21:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2671 states. [2019-12-27 02:21:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 8332 transitions. [2019-12-27 02:21:09,326 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 8332 transitions. Word has length 17 [2019-12-27 02:21:09,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:09,326 INFO L462 AbstractCegarLoop]: Abstraction has 2671 states and 8332 transitions. [2019-12-27 02:21:09,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:21:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 8332 transitions. [2019-12-27 02:21:09,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 02:21:09,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:09,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:09,330 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:09,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:09,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1635073164, now seen corresponding path program 1 times [2019-12-27 02:21:09,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:09,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887677722] [2019-12-27 02:21:09,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:09,365 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:21:09,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887677722] [2019-12-27 02:21:09,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:09,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:21:09,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815309455] [2019-12-27 02:21:09,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:21:09,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:09,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:21:09,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:09,367 INFO L87 Difference]: Start difference. First operand 2671 states and 8332 transitions. Second operand 3 states. [2019-12-27 02:21:09,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:09,455 INFO L93 Difference]: Finished difference Result 3677 states and 11111 transitions. [2019-12-27 02:21:09,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:21:09,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 02:21:09,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:09,472 INFO L225 Difference]: With dead ends: 3677 [2019-12-27 02:21:09,472 INFO L226 Difference]: Without dead ends: 3677 [2019-12-27 02:21:09,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:09,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2019-12-27 02:21:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 2975. [2019-12-27 02:21:09,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2975 states. [2019-12-27 02:21:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 9196 transitions. [2019-12-27 02:21:09,581 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 9196 transitions. Word has length 18 [2019-12-27 02:21:09,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:09,582 INFO L462 AbstractCegarLoop]: Abstraction has 2975 states and 9196 transitions. [2019-12-27 02:21:09,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:21:09,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 9196 transitions. [2019-12-27 02:21:09,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 02:21:09,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:09,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:09,585 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:09,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:09,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1634952543, now seen corresponding path program 1 times [2019-12-27 02:21:09,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:09,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092512811] [2019-12-27 02:21:09,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:09,703 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:21:09,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092512811] [2019-12-27 02:21:09,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:09,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:21:09,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3349128] [2019-12-27 02:21:09,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:21:09,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:09,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:21:09,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:21:09,707 INFO L87 Difference]: Start difference. First operand 2975 states and 9196 transitions. Second operand 4 states. [2019-12-27 02:21:09,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:09,875 INFO L93 Difference]: Finished difference Result 3817 states and 11515 transitions. [2019-12-27 02:21:09,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:21:09,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 02:21:09,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:09,887 INFO L225 Difference]: With dead ends: 3817 [2019-12-27 02:21:09,887 INFO L226 Difference]: Without dead ends: 3817 [2019-12-27 02:21:09,887 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:21:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3817 states. [2019-12-27 02:21:09,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3817 to 3609. [2019-12-27 02:21:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3609 states. [2019-12-27 02:21:09,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3609 states to 3609 states and 11065 transitions. [2019-12-27 02:21:09,979 INFO L78 Accepts]: Start accepts. Automaton has 3609 states and 11065 transitions. Word has length 18 [2019-12-27 02:21:09,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:09,980 INFO L462 AbstractCegarLoop]: Abstraction has 3609 states and 11065 transitions. [2019-12-27 02:21:09,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:21:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3609 states and 11065 transitions. [2019-12-27 02:21:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 02:21:09,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:09,982 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:09,982 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:09,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:09,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1770652005, now seen corresponding path program 1 times [2019-12-27 02:21:09,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:09,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109729901] [2019-12-27 02:21:09,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:10,060 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:21:10,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109729901] [2019-12-27 02:21:10,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:10,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:21:10,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68979917] [2019-12-27 02:21:10,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:21:10,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:10,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:21:10,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:21:10,063 INFO L87 Difference]: Start difference. First operand 3609 states and 11065 transitions. Second operand 4 states. [2019-12-27 02:21:10,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:10,379 INFO L93 Difference]: Finished difference Result 4536 states and 13681 transitions. [2019-12-27 02:21:10,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:21:10,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 02:21:10,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:10,391 INFO L225 Difference]: With dead ends: 4536 [2019-12-27 02:21:10,391 INFO L226 Difference]: Without dead ends: 4536 [2019-12-27 02:21:10,392 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:21:10,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2019-12-27 02:21:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 3800. [2019-12-27 02:21:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3800 states. [2019-12-27 02:21:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3800 states to 3800 states and 11664 transitions. [2019-12-27 02:21:10,486 INFO L78 Accepts]: Start accepts. Automaton has 3800 states and 11664 transitions. Word has length 18 [2019-12-27 02:21:10,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:10,487 INFO L462 AbstractCegarLoop]: Abstraction has 3800 states and 11664 transitions. [2019-12-27 02:21:10,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:21:10,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3800 states and 11664 transitions. [2019-12-27 02:21:10,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 02:21:10,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:10,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:10,498 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:10,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:10,498 INFO L82 PathProgramCache]: Analyzing trace with hash 808807491, now seen corresponding path program 1 times [2019-12-27 02:21:10,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:10,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359221227] [2019-12-27 02:21:10,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:10,577 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:21:10,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359221227] [2019-12-27 02:21:10,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:10,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:21:10,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044149402] [2019-12-27 02:21:10,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:21:10,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:10,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:21:10,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:21:10,579 INFO L87 Difference]: Start difference. First operand 3800 states and 11664 transitions. Second operand 6 states. [2019-12-27 02:21:10,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:10,655 INFO L93 Difference]: Finished difference Result 2862 states and 9250 transitions. [2019-12-27 02:21:10,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:21:10,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-27 02:21:10,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:10,665 INFO L225 Difference]: With dead ends: 2862 [2019-12-27 02:21:10,666 INFO L226 Difference]: Without dead ends: 2862 [2019-12-27 02:21:10,666 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:21:10,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-12-27 02:21:10,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2702. [2019-12-27 02:21:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2702 states. [2019-12-27 02:21:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 8770 transitions. [2019-12-27 02:21:10,727 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 8770 transitions. Word has length 32 [2019-12-27 02:21:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:10,727 INFO L462 AbstractCegarLoop]: Abstraction has 2702 states and 8770 transitions. [2019-12-27 02:21:10,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:21:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 8770 transitions. [2019-12-27 02:21:10,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 02:21:10,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:10,736 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:10,737 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:10,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:10,737 INFO L82 PathProgramCache]: Analyzing trace with hash -2084522499, now seen corresponding path program 1 times [2019-12-27 02:21:10,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:10,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764349064] [2019-12-27 02:21:10,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:10,829 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:21:10,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764349064] [2019-12-27 02:21:10,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:10,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:21:10,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541744988] [2019-12-27 02:21:10,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:21:10,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:10,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:21:10,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:21:10,831 INFO L87 Difference]: Start difference. First operand 2702 states and 8770 transitions. Second operand 6 states. [2019-12-27 02:21:11,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:11,078 INFO L93 Difference]: Finished difference Result 7070 states and 22784 transitions. [2019-12-27 02:21:11,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:21:11,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-27 02:21:11,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:11,090 INFO L225 Difference]: With dead ends: 7070 [2019-12-27 02:21:11,090 INFO L226 Difference]: Without dead ends: 4700 [2019-12-27 02:21:11,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:21:11,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4700 states. [2019-12-27 02:21:11,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4700 to 3034. [2019-12-27 02:21:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3034 states. [2019-12-27 02:21:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 9866 transitions. [2019-12-27 02:21:11,177 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 9866 transitions. Word has length 47 [2019-12-27 02:21:11,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:11,178 INFO L462 AbstractCegarLoop]: Abstraction has 3034 states and 9866 transitions. [2019-12-27 02:21:11,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:21:11,178 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 9866 transitions. [2019-12-27 02:21:11,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 02:21:11,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:11,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:11,188 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:11,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:11,188 INFO L82 PathProgramCache]: Analyzing trace with hash 797062781, now seen corresponding path program 2 times [2019-12-27 02:21:11,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:11,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030130361] [2019-12-27 02:21:11,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:11,268 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:21:11,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030130361] [2019-12-27 02:21:11,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:11,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:21:11,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498899651] [2019-12-27 02:21:11,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:21:11,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:11,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:21:11,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:21:11,272 INFO L87 Difference]: Start difference. First operand 3034 states and 9866 transitions. Second operand 4 states. [2019-12-27 02:21:11,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:11,303 INFO L93 Difference]: Finished difference Result 4244 states and 13199 transitions. [2019-12-27 02:21:11,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:21:11,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-27 02:21:11,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:11,310 INFO L225 Difference]: With dead ends: 4244 [2019-12-27 02:21:11,310 INFO L226 Difference]: Without dead ends: 2716 [2019-12-27 02:21:11,311 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:21:11,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2019-12-27 02:21:11,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716. [2019-12-27 02:21:11,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2019-12-27 02:21:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 8680 transitions. [2019-12-27 02:21:11,370 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 8680 transitions. Word has length 47 [2019-12-27 02:21:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:11,370 INFO L462 AbstractCegarLoop]: Abstraction has 2716 states and 8680 transitions. [2019-12-27 02:21:11,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:21:11,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 8680 transitions. [2019-12-27 02:21:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 02:21:11,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:11,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:11,379 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:11,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:11,380 INFO L82 PathProgramCache]: Analyzing trace with hash -699186775, now seen corresponding path program 3 times [2019-12-27 02:21:11,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:11,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193181959] [2019-12-27 02:21:11,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:11,509 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:21:11,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193181959] [2019-12-27 02:21:11,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:11,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:21:11,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236968469] [2019-12-27 02:21:11,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:21:11,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:11,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:21:11,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:21:11,512 INFO L87 Difference]: Start difference. First operand 2716 states and 8680 transitions. Second operand 4 states. [2019-12-27 02:21:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:11,538 INFO L93 Difference]: Finished difference Result 3334 states and 10072 transitions. [2019-12-27 02:21:11,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:21:11,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-27 02:21:11,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:11,544 INFO L225 Difference]: With dead ends: 3334 [2019-12-27 02:21:11,545 INFO L226 Difference]: Without dead ends: 1966 [2019-12-27 02:21:11,546 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:21:11,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2019-12-27 02:21:11,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1966. [2019-12-27 02:21:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1966 states. [2019-12-27 02:21:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 5635 transitions. [2019-12-27 02:21:11,580 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 5635 transitions. Word has length 47 [2019-12-27 02:21:11,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:11,580 INFO L462 AbstractCegarLoop]: Abstraction has 1966 states and 5635 transitions. [2019-12-27 02:21:11,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:21:11,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 5635 transitions. [2019-12-27 02:21:11,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 02:21:11,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:11,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:11,586 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:11,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:11,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1157951545, now seen corresponding path program 4 times [2019-12-27 02:21:11,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:11,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919761309] [2019-12-27 02:21:11,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:11,811 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:21:11,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919761309] [2019-12-27 02:21:11,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:11,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:21:11,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787860481] [2019-12-27 02:21:11,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:21:11,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:11,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:21:11,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:21:11,813 INFO L87 Difference]: Start difference. First operand 1966 states and 5635 transitions. Second operand 4 states. [2019-12-27 02:21:11,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:11,839 INFO L93 Difference]: Finished difference Result 2394 states and 6598 transitions. [2019-12-27 02:21:11,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:21:11,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-27 02:21:11,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:11,841 INFO L225 Difference]: With dead ends: 2394 [2019-12-27 02:21:11,841 INFO L226 Difference]: Without dead ends: 476 [2019-12-27 02:21:11,841 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:21:11,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-12-27 02:21:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2019-12-27 02:21:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-12-27 02:21:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1048 transitions. [2019-12-27 02:21:11,848 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1048 transitions. Word has length 47 [2019-12-27 02:21:11,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:11,849 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 1048 transitions. [2019-12-27 02:21:11,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:21:11,849 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1048 transitions. [2019-12-27 02:21:11,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 02:21:11,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:11,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:11,854 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:11,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:11,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1554022263, now seen corresponding path program 5 times [2019-12-27 02:21:11,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:11,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032780328] [2019-12-27 02:21:11,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:11,979 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:21:11,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032780328] [2019-12-27 02:21:11,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:11,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:21:11,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237366890] [2019-12-27 02:21:11,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:21:11,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:11,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:21:11,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:21:11,984 INFO L87 Difference]: Start difference. First operand 476 states and 1048 transitions. Second operand 7 states. [2019-12-27 02:21:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:12,201 INFO L93 Difference]: Finished difference Result 848 states and 1836 transitions. [2019-12-27 02:21:12,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:21:12,202 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-27 02:21:12,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:12,203 INFO L225 Difference]: With dead ends: 848 [2019-12-27 02:21:12,204 INFO L226 Difference]: Without dead ends: 568 [2019-12-27 02:21:12,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:21:12,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-12-27 02:21:12,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 508. [2019-12-27 02:21:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-12-27 02:21:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1108 transitions. [2019-12-27 02:21:12,212 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1108 transitions. Word has length 47 [2019-12-27 02:21:12,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:12,212 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 1108 transitions. [2019-12-27 02:21:12,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:21:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1108 transitions. [2019-12-27 02:21:12,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 02:21:12,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:12,214 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:12,214 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:12,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:12,215 INFO L82 PathProgramCache]: Analyzing trace with hash 768924829, now seen corresponding path program 6 times [2019-12-27 02:21:12,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:12,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82964628] [2019-12-27 02:21:12,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:12,455 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:21:12,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82964628] [2019-12-27 02:21:12,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:12,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:21:12,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246297720] [2019-12-27 02:21:12,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:21:12,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:12,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:21:12,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:21:12,457 INFO L87 Difference]: Start difference. First operand 508 states and 1108 transitions. Second operand 8 states. [2019-12-27 02:21:12,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:12,898 INFO L93 Difference]: Finished difference Result 728 states and 1468 transitions. [2019-12-27 02:21:12,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:21:12,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-12-27 02:21:12,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:12,900 INFO L225 Difference]: With dead ends: 728 [2019-12-27 02:21:12,900 INFO L226 Difference]: Without dead ends: 704 [2019-12-27 02:21:12,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:21:12,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-12-27 02:21:12,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 577. [2019-12-27 02:21:12,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-12-27 02:21:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1199 transitions. [2019-12-27 02:21:12,909 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1199 transitions. Word has length 47 [2019-12-27 02:21:12,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:12,909 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 1199 transitions. [2019-12-27 02:21:12,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:21:12,909 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1199 transitions. [2019-12-27 02:21:12,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 02:21:12,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:12,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:12,911 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:12,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:12,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1543063203, now seen corresponding path program 1 times [2019-12-27 02:21:12,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:12,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306890650] [2019-12-27 02:21:12,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:12,950 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:21:12,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306890650] [2019-12-27 02:21:12,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:12,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:21:12,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155211332] [2019-12-27 02:21:12,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:21:12,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:12,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:21:12,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:12,953 INFO L87 Difference]: Start difference. First operand 577 states and 1199 transitions. Second operand 3 states. [2019-12-27 02:21:12,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:12,988 INFO L93 Difference]: Finished difference Result 644 states and 1250 transitions. [2019-12-27 02:21:12,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:21:12,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 02:21:12,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:12,990 INFO L225 Difference]: With dead ends: 644 [2019-12-27 02:21:12,990 INFO L226 Difference]: Without dead ends: 644 [2019-12-27 02:21:12,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:12,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-12-27 02:21:13,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 564. [2019-12-27 02:21:13,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-12-27 02:21:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1108 transitions. [2019-12-27 02:21:13,001 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1108 transitions. Word has length 47 [2019-12-27 02:21:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:13,002 INFO L462 AbstractCegarLoop]: Abstraction has 564 states and 1108 transitions. [2019-12-27 02:21:13,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:21:13,002 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1108 transitions. [2019-12-27 02:21:13,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 02:21:13,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:13,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:13,004 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:13,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:13,004 INFO L82 PathProgramCache]: Analyzing trace with hash 2061863151, now seen corresponding path program 7 times [2019-12-27 02:21:13,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:13,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319507638] [2019-12-27 02:21:13,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:13,154 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:21:13,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319507638] [2019-12-27 02:21:13,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:13,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:21:13,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391016825] [2019-12-27 02:21:13,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:21:13,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:13,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:21:13,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:21:13,158 INFO L87 Difference]: Start difference. First operand 564 states and 1108 transitions. Second operand 6 states. [2019-12-27 02:21:13,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:13,588 INFO L93 Difference]: Finished difference Result 819 states and 1597 transitions. [2019-12-27 02:21:13,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:21:13,589 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-27 02:21:13,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:13,590 INFO L225 Difference]: With dead ends: 819 [2019-12-27 02:21:13,590 INFO L226 Difference]: Without dead ends: 819 [2019-12-27 02:21:13,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:21:13,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-12-27 02:21:13,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 588. [2019-12-27 02:21:13,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-12-27 02:21:13,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 1161 transitions. [2019-12-27 02:21:13,600 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 1161 transitions. Word has length 47 [2019-12-27 02:21:13,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:13,600 INFO L462 AbstractCegarLoop]: Abstraction has 588 states and 1161 transitions. [2019-12-27 02:21:13,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:21:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 1161 transitions. [2019-12-27 02:21:13,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 02:21:13,602 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:13,602 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:21:13,602 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:13,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:13,603 INFO L82 PathProgramCache]: Analyzing trace with hash 98708811, now seen corresponding path program 8 times [2019-12-27 02:21:13,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:13,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888431537] [2019-12-27 02:21:13,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:21:13,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:21:13,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888431537] [2019-12-27 02:21:13,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:21:13,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:21:13,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863721169] [2019-12-27 02:21:13,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:21:13,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:21:13,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:21:13,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:21:13,662 INFO L87 Difference]: Start difference. First operand 588 states and 1161 transitions. Second operand 3 states. [2019-12-27 02:21:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:21:13,673 INFO L93 Difference]: Finished difference Result 586 states and 1156 transitions. [2019-12-27 02:21:13,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:21:13,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 02:21:13,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:21:13,675 INFO L225 Difference]: With dead ends: 586 [2019-12-27 02:21:13,675 INFO L226 Difference]: Without dead ends: 586 [2019-12-27 02:21:13,675 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:21:13,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-12-27 02:21:13,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 494. [2019-12-27 02:21:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-12-27 02:21:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 983 transitions. [2019-12-27 02:21:13,683 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 983 transitions. Word has length 47 [2019-12-27 02:21:13,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:21:13,683 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 983 transitions. [2019-12-27 02:21:13,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:21:13,683 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 983 transitions. [2019-12-27 02:21:13,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-27 02:21:13,685 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:21:13,685 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:13,685 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:21:13,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:21:13,685 INFO L82 PathProgramCache]: Analyzing trace with hash 477153033, now seen corresponding path program 1 times [2019-12-27 02:21:13,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:21:13,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777623810] [2019-12-27 02:21:13,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:21:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:21:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:21:13,784 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:21:13,785 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:21:13,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_99| 0 0))) (and (< 0 |v_#StackHeapBarrier_23|) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~z$r_buff0_thd3~0_325) (= 0 v_~z$r_buff0_thd4~0_238) (= v_~weak$$choice2~0_127 0) (= 0 v_~__unbuffered_p0_EAX~0_49) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t965~0.base_44|)) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t965~0.base_44| 4)) (= v_~z$w_buff0~0_307 0) (= v_~__unbuffered_p3_EAX~0_136 0) (< |v_#StackHeapBarrier_23| |v_ULTIMATE.start_main_~#t965~0.base_44|) (= 0 v_~__unbuffered_p2_EAX~0_47) (= 0 v_~__unbuffered_p3_EBX~0_136) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff1_thd0~0_179 0) (= 0 v_~z$r_buff1_thd4~0_175) (= v_~z$w_buff0_used~0_604 0) (= |v_ULTIMATE.start_main_~#t965~0.offset_29| 0) (= 0 |v_#NULL.base_4|) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t965~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t965~0.base_44|) |v_ULTIMATE.start_main_~#t965~0.offset_29| 0)) |v_#memory_int_29|) (= |v_#valid_97| (store .cse0 |v_ULTIMATE.start_main_~#t965~0.base_44| 1)) (= v_~z~0_135 0) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~weak$$choice0~0_20) (= v_~z$w_buff1~0_205 0) (= v_~z$r_buff1_thd1~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_119 0) (= v_~b~0_92 0) (= v_~z$r_buff0_thd2~0_73 0) (= v_~z$r_buff0_thd1~0_73 0) (= v_~a~0_119 0) (= |v_#NULL.offset_4| 0) (= v_~x~0_37 0) (= v_~z$w_buff1_used~0_405 0) (= 0 v_~z$flush_delayed~0_40) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff1_thd3~0_260) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_31 0) (= v_~__unbuffered_cnt~0_126 0) (= v_~z$mem_tmp~0_21 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_23|, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_119, ULTIMATE.start_main_~#t968~0.base=|v_ULTIMATE.start_main_~#t968~0.base_27|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t965~0.base=|v_ULTIMATE.start_main_~#t965~0.base_44|, ~a~0=v_~a~0_119, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_238, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_136, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ~z$mem_tmp~0=v_~z$mem_tmp~0_21, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_85|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_405, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_43|, ULTIMATE.start_main_~#t966~0.offset=|v_ULTIMATE.start_main_~#t966~0.offset_26|, ~z$flush_delayed~0=v_~z$flush_delayed~0_40, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_23|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_31|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_119, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_325, ULTIMATE.start_main_~#t967~0.offset=|v_ULTIMATE.start_main_~#t967~0.offset_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ULTIMATE.start_main_~#t966~0.base=|v_ULTIMATE.start_main_~#t966~0.base_39|, ~x~0=v_~x~0_37, ULTIMATE.start_main_~#t968~0.offset=|v_ULTIMATE.start_main_~#t968~0.offset_20|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_175, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_21|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t967~0.base=|v_ULTIMATE.start_main_~#t967~0.base_39|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_179, ULTIMATE.start_main_~#t965~0.offset=|v_ULTIMATE.start_main_~#t965~0.offset_29|, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_73, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_604, ~z$w_buff0~0=v_~z$w_buff0~0_307, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_260, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_59|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_136, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_63|, ~b~0=v_~b~0_92, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_127, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_73} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, ULTIMATE.start_main_~#t968~0.base, #NULL.offset, ULTIMATE.start_main_~#t965~0.base, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t966~0.offset, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t967~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t966~0.base, ~x~0, ULTIMATE.start_main_~#t968~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t967~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t965~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:21:13,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L845-1-->L847: Formula: (and (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t966~0.base_12| 1)) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t966~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t966~0.base_12|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t966~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t966~0.base_12|) |v_ULTIMATE.start_main_~#t966~0.offset_10| 1)) |v_#memory_int_17|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t966~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t966~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t966~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t966~0.offset=|v_ULTIMATE.start_main_~#t966~0.offset_10|, ULTIMATE.start_main_~#t966~0.base=|v_ULTIMATE.start_main_~#t966~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t966~0.offset, ULTIMATE.start_main_~#t966~0.base] because there is no mapped edge [2019-12-27 02:21:13,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L847-1-->L849: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t967~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t967~0.base_13|) |v_ULTIMATE.start_main_~#t967~0.offset_11| 2)) |v_#memory_int_21|) (= 0 (select |v_#valid_55| |v_ULTIMATE.start_main_~#t967~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t967~0.offset_11|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t967~0.base_13|) (= (store |v_#valid_55| |v_ULTIMATE.start_main_~#t967~0.base_13| 1) |v_#valid_54|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t967~0.base_13| 4) |v_#length_23|) (not (= 0 |v_ULTIMATE.start_main_~#t967~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t967~0.base=|v_ULTIMATE.start_main_~#t967~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t967~0.offset=|v_ULTIMATE.start_main_~#t967~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t967~0.base, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t967~0.offset, #length] because there is no mapped edge [2019-12-27 02:21:13,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L849-1-->L851: Formula: (and (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t968~0.base_10|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t968~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t968~0.base_10|) |v_ULTIMATE.start_main_~#t968~0.offset_9| 3)) |v_#memory_int_15|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t968~0.base_10| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t968~0.base_10| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t968~0.base_10|) (= |v_ULTIMATE.start_main_~#t968~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t968~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t968~0.offset=|v_ULTIMATE.start_main_~#t968~0.offset_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_4|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t968~0.base=|v_ULTIMATE.start_main_~#t968~0.base_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t968~0.offset, ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t968~0.base, #length] because there is no mapped edge [2019-12-27 02:21:13,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L4-->L822: Formula: (and (= v_~z$r_buff0_thd4~0_24 v_~z$r_buff1_thd4~0_12) (= 1 v_~a~0_5) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_16 0)) (= v_~__unbuffered_p3_EBX~0_6 v_~b~0_6) (= v_~z$r_buff1_thd1~0_5 v_~z$r_buff0_thd1~0_6) (= v_~z$r_buff0_thd0~0_23 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff1_thd2~0_5 v_~z$r_buff0_thd2~0_6) (= v_~__unbuffered_p3_EAX~0_7 v_~a~0_5) (= v_~z$r_buff0_thd3~0_49 v_~z$r_buff1_thd3~0_27) (= v_~z$r_buff0_thd4~0_23 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_16, ~b~0=v_~b~0_6, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_24, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_6} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_16, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_12, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_6, ~a~0=v_~a~0_5, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_23, ~b~0=v_~b~0_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_5, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_7, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_23, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_6} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 02:21:13,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_112 (+ v_~__unbuffered_cnt~0_113 1)) (= v_P0Thread1of1ForFork3_~arg.base_22 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_27) (= v_~b~0_68 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_22) (= |v_P0Thread1of1ForFork3_#res.offset_5| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_33} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, ~b~0=v_~b~0_68, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_22, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_112, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_5|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_22, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_33} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-27 02:21:13,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_15 |v_P1Thread1of1ForFork0_#in~arg.base_15|) (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_19) (= 0 |v_P1Thread1of1ForFork0_#res.offset_9|) (= 0 |v_P1Thread1of1ForFork0_#res.base_9|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_15| v_P1Thread1of1ForFork0_~arg.offset_15) (= v_~x~0_30 1) (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1))) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_9|, ~y~0=v_~y~0_25, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_9|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-27 02:21:13,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1880583605 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite8_In1880583605| |P2Thread1of1ForFork1_#t~ite8_Out1880583605|) (= ~z$w_buff0~0_In1880583605 |P2Thread1of1ForFork1_#t~ite9_Out1880583605|)) (and (= ~z$w_buff0~0_In1880583605 |P2Thread1of1ForFork1_#t~ite8_Out1880583605|) (= |P2Thread1of1ForFork1_#t~ite9_Out1880583605| |P2Thread1of1ForFork1_#t~ite8_Out1880583605|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1880583605 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In1880583605 256) 0) .cse1) (= (mod ~z$w_buff0_used~0_In1880583605 256) 0) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1880583605 256))))) .cse0))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1880583605, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1880583605, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1880583605, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1880583605, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1880583605, ~weak$$choice2~0=~weak$$choice2~0_In1880583605, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In1880583605|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In1880583605, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1880583605, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1880583605, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1880583605, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1880583605, ~weak$$choice2~0=~weak$$choice2~0_In1880583605, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out1880583605|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out1880583605|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 02:21:13,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L784-->L785: Formula: (and (= v_~z$r_buff0_thd3~0_131 v_~z$r_buff0_thd3~0_130) (not (= (mod v_~weak$$choice2~0_38 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_12|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_8|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_38, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 02:21:13,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] L787-->L795: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_14 256))) (= 0 v_~z$flush_delayed~0_13) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= v_~z~0_40 v_~z$mem_tmp~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~z$flush_delayed~0=v_~z$flush_delayed~0_14} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 02:21:13,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In365680719 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In365680719 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In365680719 |P3Thread1of1ForFork2_#t~ite28_Out365680719|)) (and (= 0 |P3Thread1of1ForFork2_#t~ite28_Out365680719|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In365680719, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In365680719} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out365680719|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In365680719, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In365680719} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-27 02:21:13,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L824-->L824-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In-1623598485 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1623598485 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1623598485 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1623598485 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite29_Out-1623598485| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-1623598485 |P3Thread1of1ForFork2_#t~ite29_Out-1623598485|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1623598485, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1623598485, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1623598485, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1623598485} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1623598485|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1623598485, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1623598485, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1623598485, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1623598485} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 02:21:13,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L825-->L826: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In973823660 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In973823660 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out973823660) (not .cse1)) (and (= ~z$r_buff0_thd4~0_Out973823660 ~z$r_buff0_thd4~0_In973823660) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In973823660, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In973823660} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In973823660, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out973823660, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out973823660|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-27 02:21:13,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In1005530939 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1005530939 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1005530939 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1005530939 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite31_Out1005530939| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork2_#t~ite31_Out1005530939| ~z$r_buff1_thd4~0_In1005530939) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1005530939, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1005530939, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1005530939, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1005530939} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1005530939, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1005530939, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1005530939, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1005530939, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1005530939|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 02:21:13,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L826-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.offset_5|) (= |v_P3Thread1of1ForFork2_#t~ite31_44| v_~z$r_buff1_thd4~0_61) (= 0 |v_P3Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_44|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_5|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_61, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_43|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-27 02:21:13,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L851-1-->L857: Formula: (and (= v_~main$tmp_guard0~0_9 1) (= 4 v_~__unbuffered_cnt~0_50)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:21:13,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L857-2-->L857-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1847764900 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1847764900 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1847764900| ~z$w_buff1~0_In-1847764900) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out-1847764900| ~z~0_In-1847764900) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1847764900, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1847764900, ~z$w_buff1~0=~z$w_buff1~0_In-1847764900, ~z~0=~z~0_In-1847764900} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1847764900, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1847764900, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1847764900|, ~z$w_buff1~0=~z$w_buff1~0_In-1847764900, ~z~0=~z~0_In-1847764900} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 02:21:13,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L857-4-->L858: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite36_15|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_6|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-12-27 02:21:13,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L858-->L858-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In21993280 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In21993280 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out21993280| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out21993280| ~z$w_buff0_used~0_In21993280) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In21993280, ~z$w_buff0_used~0=~z$w_buff0_used~0_In21993280} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In21993280, ~z$w_buff0_used~0=~z$w_buff0_used~0_In21993280, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out21993280|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 02:21:13,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L859-->L859-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In392567073 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In392567073 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In392567073 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In392567073 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out392567073| 0)) (and (= |ULTIMATE.start_main_#t~ite39_Out392567073| ~z$w_buff1_used~0_In392567073) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In392567073, ~z$w_buff0_used~0=~z$w_buff0_used~0_In392567073, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In392567073, ~z$w_buff1_used~0=~z$w_buff1_used~0_In392567073} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In392567073, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out392567073|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In392567073, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In392567073, ~z$w_buff1_used~0=~z$w_buff1_used~0_In392567073} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 02:21:13,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L860-->L860-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2037310195 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In2037310195 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out2037310195| ~z$r_buff0_thd0~0_In2037310195)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite40_Out2037310195|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2037310195, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2037310195} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2037310195, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2037310195|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2037310195} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 02:21:13,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L861-->L861-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1638765173 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1638765173 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1638765173 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1638765173 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite41_Out-1638765173|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd0~0_In-1638765173 |ULTIMATE.start_main_#t~ite41_Out-1638765173|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1638765173, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1638765173, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1638765173, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1638765173} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1638765173|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1638765173, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1638765173, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1638765173, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1638765173} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 02:21:13,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p3_EBX~0_117) (= v_~__unbuffered_p3_EAX~0_117 1) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_23 256)) (= 0 v_~__unbuffered_p2_EAX~0_31) (= v_~z$r_buff1_thd0~0_157 |v_ULTIMATE.start_main_#t~ite41_37|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~main$tmp_guard1~0_23 0) (= 0 v_~__unbuffered_p0_EAX~0_34) (= 0 v_~__unbuffered_p1_EAX~0_26)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_117} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_157, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_117, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_117, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:21:13,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:21:13 BasicIcfg [2019-12-27 02:21:13,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:21:13,892 INFO L168 Benchmark]: Toolchain (without parser) took 20961.65 ms. Allocated memory was 146.8 MB in the beginning and 951.1 MB in the end (delta: 804.3 MB). Free memory was 101.8 MB in the beginning and 278.2 MB in the end (delta: -176.4 MB). Peak memory consumption was 627.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:21:13,893 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.7 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:21:13,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.79 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 158.4 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:21:13,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.42 ms. Allocated memory is still 204.5 MB. Free memory was 157.7 MB in the beginning and 155.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:21:13,895 INFO L168 Benchmark]: Boogie Preprocessor took 39.97 ms. Allocated memory is still 204.5 MB. Free memory was 155.2 MB in the beginning and 153.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:21:13,896 INFO L168 Benchmark]: RCFGBuilder took 810.84 ms. Allocated memory is still 204.5 MB. Free memory was 153.2 MB in the beginning and 106.9 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. [2019-12-27 02:21:13,896 INFO L168 Benchmark]: TraceAbstraction took 19326.35 ms. Allocated memory was 204.5 MB in the beginning and 951.1 MB in the end (delta: 746.6 MB). Free memory was 106.3 MB in the beginning and 278.2 MB in the end (delta: -171.9 MB). Peak memory consumption was 574.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:21:13,900 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 146.8 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 716.79 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 158.4 MB in the end (delta: -56.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.42 ms. Allocated memory is still 204.5 MB. Free memory was 157.7 MB in the beginning and 155.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.97 ms. Allocated memory is still 204.5 MB. Free memory was 155.2 MB in the beginning and 153.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 810.84 ms. Allocated memory is still 204.5 MB. Free memory was 153.2 MB in the beginning and 106.9 MB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19326.35 ms. Allocated memory was 204.5 MB in the beginning and 951.1 MB in the end (delta: 746.6 MB). Free memory was 106.3 MB in the beginning and 278.2 MB in the end (delta: -171.9 MB). Peak memory consumption was 574.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 171 ProgramPointsBefore, 79 ProgramPointsAfterwards, 193 TransitionsBefore, 87 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 19 ChoiceCompositions, 5629 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 54 SemBasedMoverChecksPositive, 182 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 48496 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t965, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t966, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t967, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t968, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 1 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 3 y = 1 [L775] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 3 z$flush_delayed = weak$$choice2 [L778] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L780] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L857] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 159 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.0s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2201 SDtfs, 2392 SDslu, 3895 SDs, 0 SdLazy, 1354 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26302occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 4062 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 614 NumberOfCodeBlocks, 614 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 549 ConstructedInterpolants, 0 QuantifiedInterpolants, 73155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...