/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:01:47,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:01:47,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:01:47,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:01:47,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:01:47,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:01:47,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:01:47,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:01:47,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:01:47,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:01:47,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:01:47,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:01:47,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:01:47,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:01:47,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:01:47,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:01:47,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:01:47,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:01:47,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:01:47,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:01:47,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:01:47,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:01:47,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:01:47,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:01:47,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:01:47,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:01:47,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:01:47,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:01:47,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:01:47,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:01:47,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:01:47,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:01:47,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:01:47,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:01:47,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:01:47,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:01:47,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:01:47,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:01:47,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:01:47,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:01:47,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:01:47,704 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:01:47,718 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:01:47,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:01:47,719 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:01:47,720 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:01:47,720 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:01:47,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:01:47,720 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:01:47,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:01:47,721 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:01:47,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:01:47,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:01:47,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:01:47,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:01:47,722 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:01:47,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:01:47,722 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:01:47,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:01:47,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:01:47,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:01:47,723 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:01:47,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:01:47,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:01:47,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:01:47,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:01:47,724 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:01:47,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:01:47,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:01:47,724 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:01:47,725 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:01:47,725 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:01:47,725 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:01:47,997 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:01:48,015 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:01:48,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:01:48,020 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:01:48,020 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:01:48,021 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.oepc.i [2019-12-27 17:01:48,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb259d19f/ddd4aaba598d47bb89cf31a526bc562c/FLAGd524e4ab5 [2019-12-27 17:01:48,611 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:01:48,612 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_pso.oepc.i [2019-12-27 17:01:48,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb259d19f/ddd4aaba598d47bb89cf31a526bc562c/FLAGd524e4ab5 [2019-12-27 17:01:48,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb259d19f/ddd4aaba598d47bb89cf31a526bc562c [2019-12-27 17:01:48,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:01:48,968 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:01:48,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:01:48,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:01:48,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:01:48,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:01:48" (1/1) ... [2019-12-27 17:01:48,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e06cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:48, skipping insertion in model container [2019-12-27 17:01:48,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:01:48" (1/1) ... [2019-12-27 17:01:48,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:01:49,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:01:49,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:01:49,599 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:01:49,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:01:49,733 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:01:49,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:49 WrapperNode [2019-12-27 17:01:49,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:01:49,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:01:49,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:01:49,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:01:49,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:49" (1/1) ... [2019-12-27 17:01:49,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:49" (1/1) ... [2019-12-27 17:01:49,794 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:01:49,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:01:49,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:01:49,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:01:49,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:49" (1/1) ... [2019-12-27 17:01:49,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:49" (1/1) ... [2019-12-27 17:01:49,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:49" (1/1) ... [2019-12-27 17:01:49,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:49" (1/1) ... [2019-12-27 17:01:49,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:49" (1/1) ... [2019-12-27 17:01:49,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:49" (1/1) ... [2019-12-27 17:01:49,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:49" (1/1) ... [2019-12-27 17:01:49,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:01:49,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:01:49,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:01:49,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:01:49,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:01:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:01:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:01:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:01:49,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:01:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:01:49,919 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:01:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:01:49,919 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:01:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:01:49,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:01:49,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:01:49,921 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:01:50,620 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:01:50,621 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:01:50,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:01:50 BoogieIcfgContainer [2019-12-27 17:01:50,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:01:50,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:01:50,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:01:50,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:01:50,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:01:48" (1/3) ... [2019-12-27 17:01:50,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205e49ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:01:50, skipping insertion in model container [2019-12-27 17:01:50,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:01:49" (2/3) ... [2019-12-27 17:01:50,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205e49ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:01:50, skipping insertion in model container [2019-12-27 17:01:50,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:01:50" (3/3) ... [2019-12-27 17:01:50,633 INFO L109 eAbstractionObserver]: Analyzing ICFG mix041_pso.oepc.i [2019-12-27 17:01:50,644 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:01:50,644 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:01:50,657 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:01:50,658 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:01:50,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,712 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,713 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,713 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,714 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,714 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,724 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,724 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,756 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,757 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,775 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,781 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,784 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:01:50,799 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:01:50,819 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:01:50,819 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:01:50,819 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:01:50,819 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:01:50,820 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:01:50,820 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:01:50,820 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:01:50,820 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:01:50,836 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 17:01:50,838 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 17:01:50,943 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 17:01:50,944 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:01:50,962 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 348 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:01:50,978 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 17:01:51,060 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 17:01:51,061 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:01:51,072 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 348 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:01:51,084 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 17:01:51,085 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:01:55,370 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 17:01:55,513 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 17:01:55,943 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82827 [2019-12-27 17:01:55,943 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 17:01:55,947 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-27 17:01:56,500 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-27 17:01:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-27 17:01:56,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:01:56,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:56,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:01:56,510 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:56,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:56,517 INFO L82 PathProgramCache]: Analyzing trace with hash 792296, now seen corresponding path program 1 times [2019-12-27 17:01:56,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:56,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361101901] [2019-12-27 17:01:56,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:56,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:01:56,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361101901] [2019-12-27 17:01:56,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:56,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:01:56,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1904113041] [2019-12-27 17:01:56,741 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:56,746 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:56,759 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:01:56,759 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:56,763 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:01:56,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:01:56,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:56,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:01:56,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:01:56,782 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-27 17:01:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:57,031 INFO L93 Difference]: Finished difference Result 8506 states and 27908 transitions. [2019-12-27 17:01:57,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:01:57,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:01:57,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:57,175 INFO L225 Difference]: With dead ends: 8506 [2019-12-27 17:01:57,175 INFO L226 Difference]: Without dead ends: 7522 [2019-12-27 17:01:57,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:01:57,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2019-12-27 17:01:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7522. [2019-12-27 17:01:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7522 states. [2019-12-27 17:01:57,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 24586 transitions. [2019-12-27 17:01:57,661 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 24586 transitions. Word has length 3 [2019-12-27 17:01:57,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:57,661 INFO L462 AbstractCegarLoop]: Abstraction has 7522 states and 24586 transitions. [2019-12-27 17:01:57,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:01:57,662 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 24586 transitions. [2019-12-27 17:01:57,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:01:57,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:57,667 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:01:57,668 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:57,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:57,668 INFO L82 PathProgramCache]: Analyzing trace with hash -476377294, now seen corresponding path program 1 times [2019-12-27 17:01:57,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:57,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200295100] [2019-12-27 17:01:57,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:01:57,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200295100] [2019-12-27 17:01:57,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:57,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:01:57,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [919503511] [2019-12-27 17:01:57,763 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:57,764 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:57,767 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:01:57,767 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:57,767 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:01:57,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:01:57,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:57,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:01:57,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:01:57,770 INFO L87 Difference]: Start difference. First operand 7522 states and 24586 transitions. Second operand 3 states. [2019-12-27 17:01:57,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:57,799 INFO L93 Difference]: Finished difference Result 1232 states and 2827 transitions. [2019-12-27 17:01:57,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:01:57,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 17:01:57,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:57,807 INFO L225 Difference]: With dead ends: 1232 [2019-12-27 17:01:57,807 INFO L226 Difference]: Without dead ends: 1232 [2019-12-27 17:01:57,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:01:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-27 17:01:57,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-27 17:01:57,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-27 17:01:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2827 transitions. [2019-12-27 17:01:57,840 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2827 transitions. Word has length 11 [2019-12-27 17:01:57,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:57,840 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2827 transitions. [2019-12-27 17:01:57,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:01:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2827 transitions. [2019-12-27 17:01:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:01:57,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:57,842 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:01:57,843 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:57,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash 394534895, now seen corresponding path program 1 times [2019-12-27 17:01:57,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:57,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197776039] [2019-12-27 17:01:57,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:57,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:01:57,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197776039] [2019-12-27 17:01:57,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:57,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:01:57,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1908968194] [2019-12-27 17:01:57,939 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:57,941 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:57,946 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 17:01:57,946 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:57,946 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:01:57,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:01:57,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:57,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:01:57,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:01:57,947 INFO L87 Difference]: Start difference. First operand 1232 states and 2827 transitions. Second operand 3 states. [2019-12-27 17:01:58,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:58,037 INFO L93 Difference]: Finished difference Result 1960 states and 4354 transitions. [2019-12-27 17:01:58,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:01:58,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 17:01:58,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:58,050 INFO L225 Difference]: With dead ends: 1960 [2019-12-27 17:01:58,050 INFO L226 Difference]: Without dead ends: 1960 [2019-12-27 17:01:58,051 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 17:01:58,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2019-12-27 17:01:58,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1384. [2019-12-27 17:01:58,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1384 states. [2019-12-27 17:01:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 3137 transitions. [2019-12-27 17:01:58,100 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 3137 transitions. Word has length 14 [2019-12-27 17:01:58,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:58,100 INFO L462 AbstractCegarLoop]: Abstraction has 1384 states and 3137 transitions. [2019-12-27 17:01:58,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:01:58,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 3137 transitions. [2019-12-27 17:01:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:01:58,105 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:58,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:01:58,105 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:58,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:58,106 INFO L82 PathProgramCache]: Analyzing trace with hash 304327747, now seen corresponding path program 1 times [2019-12-27 17:01:58,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:58,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800904478] [2019-12-27 17:01:58,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:58,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:01:58,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800904478] [2019-12-27 17:01:58,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:58,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:01:58,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [298724287] [2019-12-27 17:01:58,244 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:58,246 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:58,248 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 17:01:58,248 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:58,248 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:01:58,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:01:58,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:58,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:01:58,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:01:58,250 INFO L87 Difference]: Start difference. First operand 1384 states and 3137 transitions. Second operand 4 states. [2019-12-27 17:01:58,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:58,454 INFO L93 Difference]: Finished difference Result 1706 states and 3795 transitions. [2019-12-27 17:01:58,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:01:58,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 17:01:58,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:58,465 INFO L225 Difference]: With dead ends: 1706 [2019-12-27 17:01:58,465 INFO L226 Difference]: Without dead ends: 1706 [2019-12-27 17:01:58,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:01:58,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-12-27 17:01:58,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1646. [2019-12-27 17:01:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2019-12-27 17:01:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 3679 transitions. [2019-12-27 17:01:58,508 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 3679 transitions. Word has length 14 [2019-12-27 17:01:58,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:58,509 INFO L462 AbstractCegarLoop]: Abstraction has 1646 states and 3679 transitions. [2019-12-27 17:01:58,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:01:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 3679 transitions. [2019-12-27 17:01:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:01:58,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:58,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:01:58,511 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:58,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:58,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1071051512, now seen corresponding path program 1 times [2019-12-27 17:01:58,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:58,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345389705] [2019-12-27 17:01:58,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:01:58,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345389705] [2019-12-27 17:01:58,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:58,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:01:58,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [145593328] [2019-12-27 17:01:58,616 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:58,618 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:58,621 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 17:01:58,621 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:58,621 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:01:58,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:01:58,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:58,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:01:58,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:01:58,622 INFO L87 Difference]: Start difference. First operand 1646 states and 3679 transitions. Second operand 4 states. [2019-12-27 17:01:58,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:58,810 INFO L93 Difference]: Finished difference Result 2032 states and 4499 transitions. [2019-12-27 17:01:58,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:01:58,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 17:01:58,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:58,822 INFO L225 Difference]: With dead ends: 2032 [2019-12-27 17:01:58,822 INFO L226 Difference]: Without dead ends: 2032 [2019-12-27 17:01:58,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:01:58,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2019-12-27 17:01:58,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1750. [2019-12-27 17:01:58,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2019-12-27 17:01:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 3922 transitions. [2019-12-27 17:01:58,869 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 3922 transitions. Word has length 14 [2019-12-27 17:01:58,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:58,869 INFO L462 AbstractCegarLoop]: Abstraction has 1750 states and 3922 transitions. [2019-12-27 17:01:58,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:01:58,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 3922 transitions. [2019-12-27 17:01:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:01:58,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:58,872 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] [2019-12-27 17:01:58,872 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:58,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:58,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1681809556, now seen corresponding path program 1 times [2019-12-27 17:01:58,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:58,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935518516] [2019-12-27 17:01:58,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:58,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:01:58,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935518516] [2019-12-27 17:01:58,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:58,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:01:58,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [513274879] [2019-12-27 17:01:58,981 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:58,985 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:58,990 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 17:01:58,990 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:58,991 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:01:58,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:01:58,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:58,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:01:58,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:01:58,992 INFO L87 Difference]: Start difference. First operand 1750 states and 3922 transitions. Second operand 5 states. [2019-12-27 17:01:59,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:59,297 INFO L93 Difference]: Finished difference Result 2284 states and 4985 transitions. [2019-12-27 17:01:59,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:01:59,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 17:01:59,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:59,329 INFO L225 Difference]: With dead ends: 2284 [2019-12-27 17:01:59,329 INFO L226 Difference]: Without dead ends: 2284 [2019-12-27 17:01:59,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:01:59,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2019-12-27 17:01:59,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 2035. [2019-12-27 17:01:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2019-12-27 17:01:59,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 4506 transitions. [2019-12-27 17:01:59,398 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 4506 transitions. Word has length 25 [2019-12-27 17:01:59,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:59,399 INFO L462 AbstractCegarLoop]: Abstraction has 2035 states and 4506 transitions. [2019-12-27 17:01:59,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:01:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 4506 transitions. [2019-12-27 17:01:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:01:59,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:59,403 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] [2019-12-27 17:01:59,404 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:59,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:59,404 INFO L82 PathProgramCache]: Analyzing trace with hash 968997935, now seen corresponding path program 1 times [2019-12-27 17:01:59,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:59,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080097315] [2019-12-27 17:01:59,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:59,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:01:59,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080097315] [2019-12-27 17:01:59,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:59,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:01:59,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1369616515] [2019-12-27 17:01:59,484 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:59,491 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:59,499 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 17:01:59,499 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:59,499 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:01:59,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:01:59,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:59,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:01:59,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:01:59,500 INFO L87 Difference]: Start difference. First operand 2035 states and 4506 transitions. Second operand 3 states. [2019-12-27 17:01:59,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:59,543 INFO L93 Difference]: Finished difference Result 2578 states and 5509 transitions. [2019-12-27 17:01:59,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:01:59,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 17:01:59,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:59,561 INFO L225 Difference]: With dead ends: 2578 [2019-12-27 17:01:59,561 INFO L226 Difference]: Without dead ends: 2578 [2019-12-27 17:01:59,562 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 17:01:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2019-12-27 17:01:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1993. [2019-12-27 17:01:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1993 states. [2019-12-27 17:01:59,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1993 states to 1993 states and 4274 transitions. [2019-12-27 17:01:59,609 INFO L78 Accepts]: Start accepts. Automaton has 1993 states and 4274 transitions. Word has length 25 [2019-12-27 17:01:59,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:59,610 INFO L462 AbstractCegarLoop]: Abstraction has 1993 states and 4274 transitions. [2019-12-27 17:01:59,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:01:59,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1993 states and 4274 transitions. [2019-12-27 17:01:59,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 17:01:59,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:59,613 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] [2019-12-27 17:01:59,613 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:59,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:59,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1274554926, now seen corresponding path program 1 times [2019-12-27 17:01:59,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:59,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562252780] [2019-12-27 17:01:59,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:59,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:01:59,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562252780] [2019-12-27 17:01:59,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:59,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:01:59,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [617386887] [2019-12-27 17:01:59,696 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:59,699 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:59,708 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 17:01:59,708 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:59,709 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:01:59,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:01:59,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:59,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:01:59,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:01:59,710 INFO L87 Difference]: Start difference. First operand 1993 states and 4274 transitions. Second operand 3 states. [2019-12-27 17:01:59,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:01:59,743 INFO L93 Difference]: Finished difference Result 3111 states and 6741 transitions. [2019-12-27 17:01:59,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:01:59,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 17:01:59,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:01:59,749 INFO L225 Difference]: With dead ends: 3111 [2019-12-27 17:01:59,749 INFO L226 Difference]: Without dead ends: 1431 [2019-12-27 17:01:59,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:01:59,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-12-27 17:01:59,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1411. [2019-12-27 17:01:59,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2019-12-27 17:01:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2997 transitions. [2019-12-27 17:01:59,784 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2997 transitions. Word has length 26 [2019-12-27 17:01:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:01:59,784 INFO L462 AbstractCegarLoop]: Abstraction has 1411 states and 2997 transitions. [2019-12-27 17:01:59,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:01:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2997 transitions. [2019-12-27 17:01:59,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 17:01:59,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:01:59,787 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] [2019-12-27 17:01:59,787 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:01:59,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:01:59,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1286104553, now seen corresponding path program 1 times [2019-12-27 17:01:59,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:01:59,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178967699] [2019-12-27 17:01:59,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:01:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:01:59,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:01:59,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178967699] [2019-12-27 17:01:59,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:01:59,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:01:59,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1716594882] [2019-12-27 17:01:59,868 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:01:59,872 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:01:59,880 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 17:01:59,880 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:01:59,881 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:01:59,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:01:59,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:01:59,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:01:59,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:01:59,882 INFO L87 Difference]: Start difference. First operand 1411 states and 2997 transitions. Second operand 5 states. [2019-12-27 17:02:00,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:00,075 INFO L93 Difference]: Finished difference Result 1416 states and 2988 transitions. [2019-12-27 17:02:00,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:02:00,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 17:02:00,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:00,079 INFO L225 Difference]: With dead ends: 1416 [2019-12-27 17:02:00,079 INFO L226 Difference]: Without dead ends: 1416 [2019-12-27 17:02:00,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:02:00,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-12-27 17:02:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1374. [2019-12-27 17:02:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2019-12-27 17:02:00,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2924 transitions. [2019-12-27 17:02:00,154 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 2924 transitions. Word has length 26 [2019-12-27 17:02:00,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:00,155 INFO L462 AbstractCegarLoop]: Abstraction has 1374 states and 2924 transitions. [2019-12-27 17:02:00,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:02:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 2924 transitions. [2019-12-27 17:02:00,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:02:00,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:00,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:00,159 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:00,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:00,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1349237224, now seen corresponding path program 1 times [2019-12-27 17:02:00,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:00,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763663722] [2019-12-27 17:02:00,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:02:00,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763663722] [2019-12-27 17:02:00,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:00,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:02:00,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1514569938] [2019-12-27 17:02:00,228 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:00,232 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:00,243 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 17:02:00,244 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:00,303 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:02:00,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:02:00,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:00,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:02:00,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:02:00,305 INFO L87 Difference]: Start difference. First operand 1374 states and 2924 transitions. Second operand 7 states. [2019-12-27 17:02:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:01,060 INFO L93 Difference]: Finished difference Result 2192 states and 4592 transitions. [2019-12-27 17:02:01,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:02:01,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-12-27 17:02:01,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:01,066 INFO L225 Difference]: With dead ends: 2192 [2019-12-27 17:02:01,066 INFO L226 Difference]: Without dead ends: 2192 [2019-12-27 17:02:01,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:02:01,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-12-27 17:02:01,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1982. [2019-12-27 17:02:01,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-27 17:02:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4188 transitions. [2019-12-27 17:02:01,107 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4188 transitions. Word has length 27 [2019-12-27 17:02:01,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:01,107 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4188 transitions. [2019-12-27 17:02:01,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:02:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4188 transitions. [2019-12-27 17:02:01,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 17:02:01,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:01,111 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:01,111 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:01,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:01,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1804230119, now seen corresponding path program 1 times [2019-12-27 17:02:01,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:01,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560410526] [2019-12-27 17:02:01,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:01,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:02:01,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560410526] [2019-12-27 17:02:01,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:01,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:02:01,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1033330572] [2019-12-27 17:02:01,154 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:01,159 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:01,170 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 17:02:01,171 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:01,185 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 17:02:01,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:02:01,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:01,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:02:01,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:02:01,187 INFO L87 Difference]: Start difference. First operand 1982 states and 4188 transitions. Second operand 5 states. [2019-12-27 17:02:01,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:01,204 INFO L93 Difference]: Finished difference Result 1109 states and 2212 transitions. [2019-12-27 17:02:01,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:02:01,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 17:02:01,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:01,207 INFO L225 Difference]: With dead ends: 1109 [2019-12-27 17:02:01,207 INFO L226 Difference]: Without dead ends: 1001 [2019-12-27 17:02:01,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 17:02:01,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2019-12-27 17:02:01,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 923. [2019-12-27 17:02:01,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2019-12-27 17:02:01,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1913 transitions. [2019-12-27 17:02:01,226 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1913 transitions. Word has length 28 [2019-12-27 17:02:01,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:01,226 INFO L462 AbstractCegarLoop]: Abstraction has 923 states and 1913 transitions. [2019-12-27 17:02:01,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:02:01,226 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1913 transitions. [2019-12-27 17:02:01,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:02:01,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:01,229 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:01,229 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:01,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:01,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1370475912, now seen corresponding path program 1 times [2019-12-27 17:02:01,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:01,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187027101] [2019-12-27 17:02:01,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:02:01,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187027101] [2019-12-27 17:02:01,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:01,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:02:01,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [47173045] [2019-12-27 17:02:01,353 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:01,366 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:01,502 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 183 transitions. [2019-12-27 17:02:01,502 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:01,547 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:02:01,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:02:01,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:01,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:02:01,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:02:01,548 INFO L87 Difference]: Start difference. First operand 923 states and 1913 transitions. Second operand 8 states. [2019-12-27 17:02:01,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:01,769 INFO L93 Difference]: Finished difference Result 1593 states and 3217 transitions. [2019-12-27 17:02:01,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:02:01,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-12-27 17:02:01,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:01,772 INFO L225 Difference]: With dead ends: 1593 [2019-12-27 17:02:01,772 INFO L226 Difference]: Without dead ends: 1060 [2019-12-27 17:02:01,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:02:01,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-12-27 17:02:01,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 922. [2019-12-27 17:02:01,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2019-12-27 17:02:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1886 transitions. [2019-12-27 17:02:01,790 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1886 transitions. Word has length 51 [2019-12-27 17:02:01,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:01,791 INFO L462 AbstractCegarLoop]: Abstraction has 922 states and 1886 transitions. [2019-12-27 17:02:01,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:02:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1886 transitions. [2019-12-27 17:02:01,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:02:01,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:01,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:01,794 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:01,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:01,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1368511210, now seen corresponding path program 2 times [2019-12-27 17:02:01,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:01,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297615284] [2019-12-27 17:02:01,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:02:01,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297615284] [2019-12-27 17:02:01,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:01,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:02:01,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1119196342] [2019-12-27 17:02:01,888 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:01,902 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:01,959 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 191 transitions. [2019-12-27 17:02:01,960 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:01,998 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:02:01,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:02:01,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:01,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:02:01,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:02:01,999 INFO L87 Difference]: Start difference. First operand 922 states and 1886 transitions. Second operand 6 states. [2019-12-27 17:02:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:02,489 INFO L93 Difference]: Finished difference Result 1079 states and 2184 transitions. [2019-12-27 17:02:02,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:02:02,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-27 17:02:02,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:02,492 INFO L225 Difference]: With dead ends: 1079 [2019-12-27 17:02:02,492 INFO L226 Difference]: Without dead ends: 1079 [2019-12-27 17:02:02,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 5 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 17:02:02,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-12-27 17:02:02,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 952. [2019-12-27 17:02:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-12-27 17:02:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1941 transitions. [2019-12-27 17:02:02,512 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1941 transitions. Word has length 51 [2019-12-27 17:02:02,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:02,513 INFO L462 AbstractCegarLoop]: Abstraction has 952 states and 1941 transitions. [2019-12-27 17:02:02,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:02:02,513 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1941 transitions. [2019-12-27 17:02:02,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:02:02,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:02,515 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:02,516 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:02,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:02,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1240455298, now seen corresponding path program 3 times [2019-12-27 17:02:02,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:02,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656082199] [2019-12-27 17:02:02,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:02:02,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656082199] [2019-12-27 17:02:02,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:02,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:02:02,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [170906409] [2019-12-27 17:02:02,612 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:02,628 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:03,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 129 transitions. [2019-12-27 17:02:03,046 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:03,048 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:02:03,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:02:03,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:03,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:02:03,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:02:03,049 INFO L87 Difference]: Start difference. First operand 952 states and 1941 transitions. Second operand 5 states. [2019-12-27 17:02:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:03,255 INFO L93 Difference]: Finished difference Result 1081 states and 2174 transitions. [2019-12-27 17:02:03,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:02:03,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-27 17:02:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:03,260 INFO L225 Difference]: With dead ends: 1081 [2019-12-27 17:02:03,260 INFO L226 Difference]: Without dead ends: 1081 [2019-12-27 17:02:03,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:02:03,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-12-27 17:02:03,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 993. [2019-12-27 17:02:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 993 states. [2019-12-27 17:02:03,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 2021 transitions. [2019-12-27 17:02:03,282 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 2021 transitions. Word has length 51 [2019-12-27 17:02:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:03,283 INFO L462 AbstractCegarLoop]: Abstraction has 993 states and 2021 transitions. [2019-12-27 17:02:03,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:02:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 2021 transitions. [2019-12-27 17:02:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:02:03,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:03,285 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:03,286 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:03,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:03,286 INFO L82 PathProgramCache]: Analyzing trace with hash 503151608, now seen corresponding path program 4 times [2019-12-27 17:02:03,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:03,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022050932] [2019-12-27 17:02:03,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:02:03,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022050932] [2019-12-27 17:02:03,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:03,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:02:03,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1283743887] [2019-12-27 17:02:03,402 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:03,417 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:03,462 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 111 transitions. [2019-12-27 17:02:03,463 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:03,464 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:02:03,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:02:03,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:03,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:02:03,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:02:03,465 INFO L87 Difference]: Start difference. First operand 993 states and 2021 transitions. Second operand 3 states. [2019-12-27 17:02:03,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:03,480 INFO L93 Difference]: Finished difference Result 993 states and 2020 transitions. [2019-12-27 17:02:03,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:02:03,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 17:02:03,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:03,482 INFO L225 Difference]: With dead ends: 993 [2019-12-27 17:02:03,483 INFO L226 Difference]: Without dead ends: 993 [2019-12-27 17:02:03,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:02:03,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-12-27 17:02:03,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 882. [2019-12-27 17:02:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2019-12-27 17:02:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1817 transitions. [2019-12-27 17:02:03,510 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1817 transitions. Word has length 51 [2019-12-27 17:02:03,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:03,511 INFO L462 AbstractCegarLoop]: Abstraction has 882 states and 1817 transitions. [2019-12-27 17:02:03,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:02:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1817 transitions. [2019-12-27 17:02:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:02:03,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:03,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:03,513 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:03,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:03,514 INFO L82 PathProgramCache]: Analyzing trace with hash -480319677, now seen corresponding path program 1 times [2019-12-27 17:02:03,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:03,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43928082] [2019-12-27 17:02:03,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:02:03,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:02:03,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43928082] [2019-12-27 17:02:03,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:02:03,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:02:03,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1058603238] [2019-12-27 17:02:03,661 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:02:03,674 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:02:03,723 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 130 transitions. [2019-12-27 17:02:03,723 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:02:03,725 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:02:03,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:02:03,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:02:03,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:02:03,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:02:03,726 INFO L87 Difference]: Start difference. First operand 882 states and 1817 transitions. Second operand 5 states. [2019-12-27 17:02:03,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:02:03,790 INFO L93 Difference]: Finished difference Result 1057 states and 2181 transitions. [2019-12-27 17:02:03,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:02:03,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 17:02:03,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:02:03,792 INFO L225 Difference]: With dead ends: 1057 [2019-12-27 17:02:03,792 INFO L226 Difference]: Without dead ends: 1057 [2019-12-27 17:02:03,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 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 17:02:03,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-12-27 17:02:03,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 823. [2019-12-27 17:02:03,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-27 17:02:03,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1716 transitions. [2019-12-27 17:02:03,810 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1716 transitions. Word has length 52 [2019-12-27 17:02:03,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:02:03,810 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1716 transitions. [2019-12-27 17:02:03,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:02:03,811 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1716 transitions. [2019-12-27 17:02:03,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:02:03,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:02:03,814 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:02:03,814 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:02:03,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:02:03,815 INFO L82 PathProgramCache]: Analyzing trace with hash -409769665, now seen corresponding path program 1 times [2019-12-27 17:02:03,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:02:03,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133176059] [2019-12-27 17:02:03,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:02:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:02:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:02:04,036 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:02:04,037 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:02:04,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_60| 0 0))) (and (= v_~z$mem_tmp~0_25 0) (= v_~y~0_23 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1093~0.base_27|)) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_98 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$w_buff1~0_160 0) (= 0 v_~weak$$choice0~0_23) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1093~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1093~0.base_27|) |v_ULTIMATE.start_main_~#t1093~0.offset_19| 0)) |v_#memory_int_11|) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$r_buff0_thd1~0_174 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p1_EAX~0_45) (= |v_#valid_58| (store .cse0 |v_ULTIMATE.start_main_~#t1093~0.base_27| 1)) (= v_~z$w_buff0~0_252 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1093~0.base_27|) (= v_~z~0_120 0) (= v_~z$r_buff0_thd0~0_134 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~main$tmp_guard0~0_20 0) (= v_~z$read_delayed~0_7 0) (= |v_ULTIMATE.start_main_~#t1093~0.offset_19| 0) (= 0 v_~z$flush_delayed~0_33) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1093~0.base_27| 4)) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff1_thd2~0_196 0) (= v_~z$r_buff1_thd0~0_144 0) (= 0 v_~weak$$choice2~0_99) (= v_~z$w_buff0_used~0_606 0) (= v_~z$w_buff1_used~0_306 0) (= 0 |v_#NULL.base_5|) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$r_buff0_thd2~0_279 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1093~0.offset=|v_ULTIMATE.start_main_~#t1093~0.offset_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_196, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t1093~0.base=|v_ULTIMATE.start_main_~#t1093~0.base_27|, ~z$w_buff1~0=v_~z$w_buff1~0_160, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_370|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_93|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_134, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_45, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, #length=|v_#length_17|, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_279, ~z$mem_tmp~0=v_~z$mem_tmp~0_25, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ULTIMATE.start_main_~#t1094~0.base=|v_ULTIMATE.start_main_~#t1094~0.base_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_606, ~z$w_buff0~0=v_~z$w_buff0~0_252, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_306, ULTIMATE.start_main_~#t1094~0.offset=|v_ULTIMATE.start_main_~#t1094~0.offset_14|, ~z$flush_delayed~0=v_~z$flush_delayed~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_5|, ~weak$$choice0~0=v_~weak$$choice0~0_23, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_58|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~z~0=v_~z~0_120, ~weak$$choice2~0=v_~weak$$choice2~0_99, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_174, ~x~0=v_~x~0_98} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1093~0.offset, ~z$r_buff1_thd2~0, ~z$read_delayed~0, ULTIMATE.start_main_~#t1093~0.base, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1094~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t1094~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 17:02:04,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L4-->L740: Formula: (and (= ~x~0_Out-1167965556 1) (= ~z$r_buff0_thd1~0_In-1167965556 ~z$r_buff1_thd1~0_Out-1167965556) (= ~z$r_buff0_thd0~0_In-1167965556 ~z$r_buff1_thd0~0_Out-1167965556) (= ~z$r_buff1_thd2~0_Out-1167965556 ~z$r_buff0_thd2~0_In-1167965556) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1167965556)) (= ~z$r_buff0_thd1~0_Out-1167965556 1)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1167965556, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1167965556, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1167965556, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1167965556} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1167965556, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1167965556, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1167965556, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1167965556, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1167965556, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1167965556, ~x~0=~x~0_Out-1167965556, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1167965556} AuxVars[] AssignedVars[~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 17:02:04,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L802-1-->L804: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1094~0.base_11|) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1094~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1094~0.base_11|) |v_ULTIMATE.start_main_~#t1094~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1094~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1094~0.base_11| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1094~0.base_11| 4) |v_#length_11|) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1094~0.base_11|) 0) (= |v_ULTIMATE.start_main_~#t1094~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1094~0.base=|v_ULTIMATE.start_main_~#t1094~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1094~0.offset=|v_ULTIMATE.start_main_~#t1094~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1094~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1094~0.offset] because there is no mapped edge [2019-12-27 17:02:04,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1061683382 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1061683382 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1061683382| ~z$w_buff0_used~0_In1061683382)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1061683382| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1061683382, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1061683382} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1061683382|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1061683382, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1061683382} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:02:04,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In520035437 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In520035437 256))) (.cse2 (= (mod ~z$r_buff1_thd1~0_In520035437 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In520035437 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out520035437| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out520035437| ~z$w_buff1_used~0_In520035437) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In520035437, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In520035437, ~z$w_buff1_used~0=~z$w_buff1_used~0_In520035437, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In520035437} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out520035437|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In520035437, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In520035437, ~z$w_buff1_used~0=~z$w_buff1_used~0_In520035437, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In520035437} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:02:04,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In320863212 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In320863212 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In320863212 ~z$r_buff0_thd1~0_Out320863212) (or .cse0 .cse1)) (and (= 0 ~z$r_buff0_thd1~0_Out320863212) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In320863212, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In320863212} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In320863212, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out320863212|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out320863212} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:02:04,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In448777829 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In448777829 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In448777829 256))) (.cse0 (= (mod ~z$r_buff1_thd1~0_In448777829 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out448777829| ~z$r_buff1_thd1~0_In448777829) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out448777829| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In448777829, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In448777829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In448777829, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In448777829} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In448777829, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out448777829|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In448777829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In448777829, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In448777829} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:02:04,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_34|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 17:02:04,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~z$r_buff0_thd2~0_61 v_~z$r_buff0_thd2~0_60)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_61} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_25, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 17:02:04,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L773-->L773-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In285350927 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out285350927| ~z$r_buff1_thd2~0_In285350927) (= |P1Thread1of1ForFork1_#t~ite29_Out285350927| |P1Thread1of1ForFork1_#t~ite30_Out285350927|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In285350927 256)))) (or (and (= 0 (mod ~z$r_buff1_thd2~0_In285350927 256)) .cse1) (= (mod ~z$w_buff0_used~0_In285350927 256) 0) (and (= (mod ~z$w_buff1_used~0_In285350927 256) 0) .cse1)))) (and (= ~z$r_buff1_thd2~0_In285350927 |P1Thread1of1ForFork1_#t~ite30_Out285350927|) (= |P1Thread1of1ForFork1_#t~ite29_In285350927| |P1Thread1of1ForFork1_#t~ite29_Out285350927|) (not .cse0)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In285350927|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In285350927, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In285350927, ~z$w_buff1_used~0=~z$w_buff1_used~0_In285350927, ~weak$$choice2~0=~weak$$choice2~0_In285350927, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In285350927} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out285350927|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out285350927|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In285350927, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In285350927, ~z$w_buff1_used~0=~z$w_buff1_used~0_In285350927, ~weak$$choice2~0=~weak$$choice2~0_In285350927, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In285350927} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 17:02:04,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= v_~z~0_27 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_8) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 17:02:04,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1661966372 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1661966372 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1661966372 |P1Thread1of1ForFork1_#t~ite32_Out-1661966372|)) (and (= ~z~0_In-1661966372 |P1Thread1of1ForFork1_#t~ite32_Out-1661966372|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1661966372, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1661966372, ~z$w_buff1~0=~z$w_buff1~0_In-1661966372, ~z~0=~z~0_In-1661966372} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1661966372, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1661966372, ~z$w_buff1~0=~z$w_buff1~0_In-1661966372, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1661966372|, ~z~0=~z~0_In-1661966372} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 17:02:04,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~z~0_39 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~z~0=v_~z~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~z~0] because there is no mapped edge [2019-12-27 17:02:04,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1571527869 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1571527869 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-1571527869| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1571527869| ~z$w_buff0_used~0_In-1571527869) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1571527869, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1571527869} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1571527869, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1571527869|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1571527869} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 17:02:04,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1027702828 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd2~0_In-1027702828 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1027702828 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-1027702828 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out-1027702828| ~z$w_buff1_used~0_In-1027702828) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1027702828| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1027702828, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1027702828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1027702828, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1027702828} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1027702828, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1027702828, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1027702828, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1027702828|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1027702828} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 17:02:04,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1767972159 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1767972159 256)))) (or (and (= ~z$r_buff0_thd2~0_In1767972159 |P1Thread1of1ForFork1_#t~ite36_Out1767972159|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out1767972159| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1767972159, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1767972159} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1767972159, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1767972159, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1767972159|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 17:02:04,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In905785466 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In905785466 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In905785466 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In905785466 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out905785466|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In905785466 |P1Thread1of1ForFork1_#t~ite37_Out905785466|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In905785466, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In905785466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In905785466, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In905785466} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In905785466, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In905785466, ~z$w_buff1_used~0=~z$w_buff1_used~0_In905785466, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In905785466, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out905785466|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 17:02:04,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite37_24| v_~z$r_buff1_thd2~0_88) (= v_~__unbuffered_cnt~0_28 (+ v_~__unbuffered_cnt~0_29 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_24|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_88, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_23|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 17:02:04,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 2 v_~__unbuffered_cnt~0_16)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 17:02:04,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-733616141 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-733616141 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite40_Out-733616141| |ULTIMATE.start_main_#t~ite41_Out-733616141|))) (or (and (not .cse0) (not .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite40_Out-733616141| ~z$w_buff1~0_In-733616141)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-733616141| ~z~0_In-733616141) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-733616141, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-733616141, ~z$w_buff1~0=~z$w_buff1~0_In-733616141, ~z~0=~z~0_In-733616141} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-733616141|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-733616141|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-733616141, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-733616141, ~z$w_buff1~0=~z$w_buff1~0_In-733616141, ~z~0=~z~0_In-733616141} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 17:02:04,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1151810328 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1151810328 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1151810328 |ULTIMATE.start_main_#t~ite42_Out-1151810328|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1151810328|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1151810328, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1151810328} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1151810328, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1151810328, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1151810328|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:02:04,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1346005346 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1346005346 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1346005346 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1346005346 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1346005346|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1346005346 |ULTIMATE.start_main_#t~ite43_Out1346005346|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1346005346, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1346005346, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1346005346, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1346005346} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1346005346, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1346005346, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1346005346, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1346005346, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1346005346|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 17:02:04,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-2075308078 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2075308078 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-2075308078 |ULTIMATE.start_main_#t~ite44_Out-2075308078|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-2075308078|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2075308078, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2075308078} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2075308078, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2075308078, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2075308078|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 17:02:04,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1936492867 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1936492867 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1936492867 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-1936492867 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1936492867| ~z$r_buff1_thd0~0_In-1936492867) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite45_Out-1936492867| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1936492867, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1936492867, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1936492867, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1936492867} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1936492867, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1936492867, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1936492867, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1936492867, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1936492867|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 17:02:04,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~__unbuffered_p1_EBX~0_28 0) (= v_~z$r_buff1_thd0~0_107 |v_ULTIMATE.start_main_#t~ite45_60|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 1 v_~__unbuffered_p1_EAX~0_28) (= v_~x~0_67 2) (= v_~main$tmp_guard1~0_22 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_107, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~x~0=v_~x~0_67, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_59|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:02:04,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:02:04 BasicIcfg [2019-12-27 17:02:04,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:02:04,225 INFO L168 Benchmark]: Toolchain (without parser) took 15257.19 ms. Allocated memory was 137.9 MB in the beginning and 638.6 MB in the end (delta: 500.7 MB). Free memory was 100.8 MB in the beginning and 549.8 MB in the end (delta: -449.0 MB). Peak memory consumption was 352.4 MB. Max. memory is 7.1 GB. [2019-12-27 17:02:04,228 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 17:02:04,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 764.36 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.4 MB in the beginning and 155.8 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:02:04,232 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.26 ms. Allocated memory is still 201.3 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:02:04,232 INFO L168 Benchmark]: Boogie Preprocessor took 41.83 ms. Allocated memory is still 201.3 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:02:04,235 INFO L168 Benchmark]: RCFGBuilder took 786.12 ms. Allocated memory is still 201.3 MB. Free memory was 150.5 MB in the beginning and 106.4 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:02:04,236 INFO L168 Benchmark]: TraceAbstraction took 13599.64 ms. Allocated memory was 201.3 MB in the beginning and 638.6 MB in the end (delta: 437.3 MB). Free memory was 105.7 MB in the beginning and 549.8 MB in the end (delta: -444.1 MB). Peak memory consumption was 293.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:02:04,244 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.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 764.36 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.4 MB in the beginning and 155.8 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.26 ms. Allocated memory is still 201.3 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.83 ms. Allocated memory is still 201.3 MB. Free memory was 153.1 MB in the beginning and 150.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 786.12 ms. Allocated memory is still 201.3 MB. Free memory was 150.5 MB in the beginning and 106.4 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13599.64 ms. Allocated memory was 201.3 MB in the beginning and 638.6 MB in the end (delta: 437.3 MB). Free memory was 105.7 MB in the beginning and 549.8 MB in the end (delta: -444.1 MB). Peak memory consumption was 293.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 148 ProgramPointsBefore, 77 ProgramPointsAfterwards, 182 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 13 FixpointIterations, 30 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 25 ChoiceCompositions, 4608 VarBasedMoverChecksPositive, 304 VarBasedMoverChecksNegative, 234 SemBasedMoverChecksPositive, 187 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 82827 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1093, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L726] 1 z$w_buff1 = z$w_buff0 [L727] 1 z$w_buff0 = 1 [L728] 1 z$w_buff1_used = z$w_buff0_used [L729] 1 z$w_buff0_used = (_Bool)1 [L740] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L804] FCALL, FORK 0 pthread_create(&t1094, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L754] 2 x = 2 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L740] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L742] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L779] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L780] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L810] EXPR 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L810] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L811] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L812] 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 [L813] 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 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.2s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1928 SDtfs, 1383 SDslu, 3399 SDs, 0 SdLazy, 1964 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 45 SyntacticMatches, 15 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred 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: 1.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 2800 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 522 NumberOfCodeBlocks, 522 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 84175 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...