/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:03:27,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:03:27,687 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:03:27,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:03:27,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:03:27,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:03:27,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:03:27,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:03:27,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:03:27,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:03:27,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:03:27,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:03:27,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:03:27,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:03:27,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:03:27,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:03:27,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:03:27,722 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:03:27,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:03:27,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:03:27,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:03:27,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:03:27,729 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:03:27,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:03:27,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:03:27,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:03:27,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:03:27,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:03:27,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:03:27,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:03:27,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:03:27,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:03:27,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:03:27,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:03:27,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:03:27,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:03:27,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:03:27,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:03:27,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:03:27,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:03:27,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:03:27,742 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-VariableLbe.epf [2019-12-18 23:03:27,756 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:03:27,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:03:27,758 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:03:27,758 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:03:27,758 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:03:27,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:03:27,758 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:03:27,759 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:03:27,759 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:03:27,759 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:03:27,759 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:03:27,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:03:27,760 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:03:27,760 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:03:27,760 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:03:27,760 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:03:27,760 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:03:27,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:03:27,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:03:27,761 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:03:27,761 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:03:27,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:03:27,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:03:27,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:03:27,762 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:03:27,762 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:03:27,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:03:27,763 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 23:03:27,763 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:03:27,763 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:03:28,032 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:03:28,049 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:03:28,053 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:03:28,055 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:03:28,055 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:03:28,056 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i [2019-12-18 23:03:28,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e57756e/3af51a2e37d64778b20e0c0d6fb4b1d6/FLAG05e5daebe [2019-12-18 23:03:28,665 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:03:28,666 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i [2019-12-18 23:03:28,679 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e57756e/3af51a2e37d64778b20e0c0d6fb4b1d6/FLAG05e5daebe [2019-12-18 23:03:28,960 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e57756e/3af51a2e37d64778b20e0c0d6fb4b1d6 [2019-12-18 23:03:28,969 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:03:28,971 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:03:28,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:03:28,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:03:28,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:03:28,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:03:28" (1/1) ... [2019-12-18 23:03:28,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a58602b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:28, skipping insertion in model container [2019-12-18 23:03:28,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:03:28" (1/1) ... [2019-12-18 23:03:28,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:03:29,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:03:29,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:03:29,521 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:03:29,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:03:29,684 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:03:29,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29 WrapperNode [2019-12-18 23:03:29,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:03:29,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:03:29,685 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:03:29,685 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:03:29,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (1/1) ... [2019-12-18 23:03:29,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (1/1) ... [2019-12-18 23:03:29,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:03:29,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:03:29,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:03:29,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:03:29,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (1/1) ... [2019-12-18 23:03:29,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (1/1) ... [2019-12-18 23:03:29,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (1/1) ... [2019-12-18 23:03:29,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (1/1) ... [2019-12-18 23:03:29,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (1/1) ... [2019-12-18 23:03:29,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (1/1) ... [2019-12-18 23:03:29,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (1/1) ... [2019-12-18 23:03:29,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:03:29,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:03:29,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:03:29,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:03:29,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (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-18 23:03:29,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:03:29,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 23:03:29,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:03:29,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:03:29,883 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 23:03:29,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 23:03:29,884 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 23:03:29,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 23:03:29,884 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 23:03:29,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 23:03:29,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 23:03:29,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:03:29,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:03:29,887 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 23:03:30,636 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:03:30,636 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 23:03:30,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:03:30 BoogieIcfgContainer [2019-12-18 23:03:30,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:03:30,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:03:30,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:03:30,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:03:30,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:03:28" (1/3) ... [2019-12-18 23:03:30,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5025636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:03:30, skipping insertion in model container [2019-12-18 23:03:30,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:29" (2/3) ... [2019-12-18 23:03:30,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5025636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:03:30, skipping insertion in model container [2019-12-18 23:03:30,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:03:30" (3/3) ... [2019-12-18 23:03:30,647 INFO L109 eAbstractionObserver]: Analyzing ICFG safe030_pso.oepc.i [2019-12-18 23:03:30,658 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:03:30,658 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:03:30,666 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 23:03:30,667 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:03:30,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,708 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,708 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,708 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,709 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,709 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,718 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,718 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,745 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,745 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,745 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,760 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,764 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,765 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,777 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,778 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,782 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,783 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:30,799 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 23:03:30,821 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:03:30,821 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:03:30,821 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:03:30,821 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:03:30,822 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:03:30,822 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:03:30,822 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:03:30,822 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:03:30,843 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-18 23:03:30,845 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-18 23:03:30,948 INFO L126 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-18 23:03:30,948 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:03:30,967 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 9/167 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 23:03:30,990 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-18 23:03:31,040 INFO L126 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-18 23:03:31,040 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:03:31,051 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 9/167 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 23:03:31,074 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-18 23:03:31,075 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:03:34,377 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 23:03:34,482 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 23:03:34,516 INFO L206 etLargeBlockEncoding]: Checked pairs total: 93606 [2019-12-18 23:03:34,516 INFO L214 etLargeBlockEncoding]: Total number of compositions: 107 [2019-12-18 23:03:34,520 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 110 transitions [2019-12-18 23:03:54,033 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126872 states. [2019-12-18 23:03:54,034 INFO L276 IsEmpty]: Start isEmpty. Operand 126872 states. [2019-12-18 23:03:54,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:03:54,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:54,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:03:54,042 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:54,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:54,049 INFO L82 PathProgramCache]: Analyzing trace with hash 835743, now seen corresponding path program 1 times [2019-12-18 23:03:54,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:54,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818237398] [2019-12-18 23:03:54,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:54,368 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-18 23:03:54,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818237398] [2019-12-18 23:03:54,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:54,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:03:54,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370150340] [2019-12-18 23:03:54,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:03:54,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:54,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:03:54,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:54,401 INFO L87 Difference]: Start difference. First operand 126872 states. Second operand 3 states. [2019-12-18 23:03:58,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:58,446 INFO L93 Difference]: Finished difference Result 126172 states and 544995 transitions. [2019-12-18 23:03:58,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:03:58,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:03:58,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:59,549 INFO L225 Difference]: With dead ends: 126172 [2019-12-18 23:03:59,550 INFO L226 Difference]: Without dead ends: 123624 [2019-12-18 23:03:59,551 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-18 23:04:06,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123624 states. [2019-12-18 23:04:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123624 to 123624. [2019-12-18 23:04:08,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123624 states. [2019-12-18 23:04:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123624 states to 123624 states and 534607 transitions. [2019-12-18 23:04:13,425 INFO L78 Accepts]: Start accepts. Automaton has 123624 states and 534607 transitions. Word has length 3 [2019-12-18 23:04:13,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:13,426 INFO L462 AbstractCegarLoop]: Abstraction has 123624 states and 534607 transitions. [2019-12-18 23:04:13,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:13,426 INFO L276 IsEmpty]: Start isEmpty. Operand 123624 states and 534607 transitions. [2019-12-18 23:04:13,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 23:04:13,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:13,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:13,431 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:13,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:13,431 INFO L82 PathProgramCache]: Analyzing trace with hash 358672898, now seen corresponding path program 1 times [2019-12-18 23:04:13,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:13,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435432841] [2019-12-18 23:04:13,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:13,550 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-18 23:04:13,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435432841] [2019-12-18 23:04:13,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:13,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:13,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059517638] [2019-12-18 23:04:13,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:04:13,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:13,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:04:13,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:04:13,555 INFO L87 Difference]: Start difference. First operand 123624 states and 534607 transitions. Second operand 4 states. [2019-12-18 23:04:19,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:19,933 INFO L93 Difference]: Finished difference Result 192934 states and 798071 transitions. [2019-12-18 23:04:19,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:04:19,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 23:04:19,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:20,587 INFO L225 Difference]: With dead ends: 192934 [2019-12-18 23:04:20,587 INFO L226 Difference]: Without dead ends: 192885 [2019-12-18 23:04:20,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:04:25,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192885 states. [2019-12-18 23:04:29,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192885 to 177949. [2019-12-18 23:04:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177949 states. [2019-12-18 23:04:30,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177949 states to 177949 states and 745039 transitions. [2019-12-18 23:04:30,360 INFO L78 Accepts]: Start accepts. Automaton has 177949 states and 745039 transitions. Word has length 11 [2019-12-18 23:04:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:30,360 INFO L462 AbstractCegarLoop]: Abstraction has 177949 states and 745039 transitions. [2019-12-18 23:04:30,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:04:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 177949 states and 745039 transitions. [2019-12-18 23:04:30,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:04:30,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:30,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:30,366 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:30,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:30,367 INFO L82 PathProgramCache]: Analyzing trace with hash -432185852, now seen corresponding path program 1 times [2019-12-18 23:04:30,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:30,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325837858] [2019-12-18 23:04:30,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:30,418 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-18 23:04:30,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325837858] [2019-12-18 23:04:30,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:30,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:30,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376588994] [2019-12-18 23:04:30,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:30,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:30,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:30,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:30,421 INFO L87 Difference]: Start difference. First operand 177949 states and 745039 transitions. Second operand 3 states. [2019-12-18 23:04:30,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:30,558 INFO L93 Difference]: Finished difference Result 35462 states and 116599 transitions. [2019-12-18 23:04:30,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:30,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 23:04:30,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:30,615 INFO L225 Difference]: With dead ends: 35462 [2019-12-18 23:04:30,615 INFO L226 Difference]: Without dead ends: 35462 [2019-12-18 23:04:30,616 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-18 23:04:30,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35462 states. [2019-12-18 23:04:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35462 to 35462. [2019-12-18 23:04:36,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35462 states. [2019-12-18 23:04:36,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35462 states to 35462 states and 116599 transitions. [2019-12-18 23:04:36,373 INFO L78 Accepts]: Start accepts. Automaton has 35462 states and 116599 transitions. Word has length 13 [2019-12-18 23:04:36,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:36,374 INFO L462 AbstractCegarLoop]: Abstraction has 35462 states and 116599 transitions. [2019-12-18 23:04:36,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:36,374 INFO L276 IsEmpty]: Start isEmpty. Operand 35462 states and 116599 transitions. [2019-12-18 23:04:36,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 23:04:36,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:36,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:36,376 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:36,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:36,376 INFO L82 PathProgramCache]: Analyzing trace with hash -796950478, now seen corresponding path program 1 times [2019-12-18 23:04:36,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:36,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574311752] [2019-12-18 23:04:36,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:36,484 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-18 23:04:36,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574311752] [2019-12-18 23:04:36,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:36,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:36,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872742632] [2019-12-18 23:04:36,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:04:36,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:36,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:04:36,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:04:36,486 INFO L87 Difference]: Start difference. First operand 35462 states and 116599 transitions. Second operand 4 states. [2019-12-18 23:04:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:36,945 INFO L93 Difference]: Finished difference Result 47114 states and 151311 transitions. [2019-12-18 23:04:36,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:04:36,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 23:04:36,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:37,021 INFO L225 Difference]: With dead ends: 47114 [2019-12-18 23:04:37,021 INFO L226 Difference]: Without dead ends: 47107 [2019-12-18 23:04:37,022 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-18 23:04:37,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47107 states. [2019-12-18 23:04:37,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47107 to 41593. [2019-12-18 23:04:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41593 states. [2019-12-18 23:04:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41593 states to 41593 states and 135840 transitions. [2019-12-18 23:04:37,763 INFO L78 Accepts]: Start accepts. Automaton has 41593 states and 135840 transitions. Word has length 13 [2019-12-18 23:04:37,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:37,764 INFO L462 AbstractCegarLoop]: Abstraction has 41593 states and 135840 transitions. [2019-12-18 23:04:37,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:04:37,764 INFO L276 IsEmpty]: Start isEmpty. Operand 41593 states and 135840 transitions. [2019-12-18 23:04:37,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 23:04:37,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:37,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:37,769 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:37,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:37,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1918798733, now seen corresponding path program 1 times [2019-12-18 23:04:37,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:37,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53288320] [2019-12-18 23:04:37,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:37,845 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-18 23:04:37,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53288320] [2019-12-18 23:04:37,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:37,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:04:37,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519474209] [2019-12-18 23:04:37,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:04:37,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:37,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:04:37,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:04:37,848 INFO L87 Difference]: Start difference. First operand 41593 states and 135840 transitions. Second operand 5 states. [2019-12-18 23:04:39,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:39,058 INFO L93 Difference]: Finished difference Result 55558 states and 177410 transitions. [2019-12-18 23:04:39,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 23:04:39,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 23:04:39,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:39,151 INFO L225 Difference]: With dead ends: 55558 [2019-12-18 23:04:39,152 INFO L226 Difference]: Without dead ends: 55545 [2019-12-18 23:04:39,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:04:39,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55545 states. [2019-12-18 23:04:39,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55545 to 41907. [2019-12-18 23:04:39,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41907 states. [2019-12-18 23:04:39,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41907 states to 41907 states and 136705 transitions. [2019-12-18 23:04:39,981 INFO L78 Accepts]: Start accepts. Automaton has 41907 states and 136705 transitions. Word has length 19 [2019-12-18 23:04:39,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:39,982 INFO L462 AbstractCegarLoop]: Abstraction has 41907 states and 136705 transitions. [2019-12-18 23:04:39,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:04:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 41907 states and 136705 transitions. [2019-12-18 23:04:39,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:04:39,996 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:39,996 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:39,996 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:39,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:39,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1840473137, now seen corresponding path program 1 times [2019-12-18 23:04:39,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:39,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084391448] [2019-12-18 23:04:39,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:40,062 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-18 23:04:40,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084391448] [2019-12-18 23:04:40,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:40,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:04:40,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997644962] [2019-12-18 23:04:40,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:04:40,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:40,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:04:40,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:04:40,065 INFO L87 Difference]: Start difference. First operand 41907 states and 136705 transitions. Second operand 4 states. [2019-12-18 23:04:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:40,109 INFO L93 Difference]: Finished difference Result 7558 states and 20694 transitions. [2019-12-18 23:04:40,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:04:40,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 23:04:40,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:40,122 INFO L225 Difference]: With dead ends: 7558 [2019-12-18 23:04:40,122 INFO L226 Difference]: Without dead ends: 7558 [2019-12-18 23:04:40,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:04:40,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7558 states. [2019-12-18 23:04:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7558 to 7446. [2019-12-18 23:04:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7446 states. [2019-12-18 23:04:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7446 states to 7446 states and 20374 transitions. [2019-12-18 23:04:40,237 INFO L78 Accepts]: Start accepts. Automaton has 7446 states and 20374 transitions. Word has length 25 [2019-12-18 23:04:40,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:40,238 INFO L462 AbstractCegarLoop]: Abstraction has 7446 states and 20374 transitions. [2019-12-18 23:04:40,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:04:40,238 INFO L276 IsEmpty]: Start isEmpty. Operand 7446 states and 20374 transitions. [2019-12-18 23:04:40,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 23:04:40,250 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:40,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:40,250 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:40,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:40,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1306882487, now seen corresponding path program 1 times [2019-12-18 23:04:40,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:40,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786284261] [2019-12-18 23:04:40,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:40,377 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-18 23:04:40,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786284261] [2019-12-18 23:04:40,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:40,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:04:40,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226686254] [2019-12-18 23:04:40,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:04:40,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:40,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:04:40,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:04:40,381 INFO L87 Difference]: Start difference. First operand 7446 states and 20374 transitions. Second operand 5 states. [2019-12-18 23:04:40,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:40,415 INFO L93 Difference]: Finished difference Result 5313 states and 15270 transitions. [2019-12-18 23:04:40,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:04:40,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 23:04:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:40,425 INFO L225 Difference]: With dead ends: 5313 [2019-12-18 23:04:40,425 INFO L226 Difference]: Without dead ends: 5313 [2019-12-18 23:04:40,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:04:40,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2019-12-18 23:04:40,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 4949. [2019-12-18 23:04:40,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4949 states. [2019-12-18 23:04:40,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 14286 transitions. [2019-12-18 23:04:40,497 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 14286 transitions. Word has length 37 [2019-12-18 23:04:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:40,497 INFO L462 AbstractCegarLoop]: Abstraction has 4949 states and 14286 transitions. [2019-12-18 23:04:40,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:04:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 14286 transitions. [2019-12-18 23:04:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 23:04:40,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:40,505 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:40,505 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:40,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:40,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1856109427, now seen corresponding path program 1 times [2019-12-18 23:04:40,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:40,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539491185] [2019-12-18 23:04:40,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:40,587 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-18 23:04:40,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539491185] [2019-12-18 23:04:40,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:40,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:04:40,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154657654] [2019-12-18 23:04:40,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:40,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:40,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:40,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:40,590 INFO L87 Difference]: Start difference. First operand 4949 states and 14286 transitions. Second operand 3 states. [2019-12-18 23:04:40,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:40,652 INFO L93 Difference]: Finished difference Result 4958 states and 14300 transitions. [2019-12-18 23:04:40,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:40,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 23:04:40,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:40,660 INFO L225 Difference]: With dead ends: 4958 [2019-12-18 23:04:40,660 INFO L226 Difference]: Without dead ends: 4958 [2019-12-18 23:04:40,661 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-18 23:04:40,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2019-12-18 23:04:40,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4954. [2019-12-18 23:04:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4954 states. [2019-12-18 23:04:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4954 states to 4954 states and 14296 transitions. [2019-12-18 23:04:40,755 INFO L78 Accepts]: Start accepts. Automaton has 4954 states and 14296 transitions. Word has length 65 [2019-12-18 23:04:40,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:40,756 INFO L462 AbstractCegarLoop]: Abstraction has 4954 states and 14296 transitions. [2019-12-18 23:04:40,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:40,757 INFO L276 IsEmpty]: Start isEmpty. Operand 4954 states and 14296 transitions. [2019-12-18 23:04:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 23:04:40,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:40,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:40,769 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:40,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:40,770 INFO L82 PathProgramCache]: Analyzing trace with hash -907011133, now seen corresponding path program 1 times [2019-12-18 23:04:40,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:40,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593723019] [2019-12-18 23:04:40,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:40,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-18 23:04:40,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593723019] [2019-12-18 23:04:40,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:40,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:40,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761018168] [2019-12-18 23:04:40,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:40,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:40,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:40,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:40,890 INFO L87 Difference]: Start difference. First operand 4954 states and 14296 transitions. Second operand 3 states. [2019-12-18 23:04:40,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:40,926 INFO L93 Difference]: Finished difference Result 4666 states and 13247 transitions. [2019-12-18 23:04:40,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:40,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 23:04:40,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:40,934 INFO L225 Difference]: With dead ends: 4666 [2019-12-18 23:04:40,934 INFO L226 Difference]: Without dead ends: 4666 [2019-12-18 23:04:40,934 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-18 23:04:41,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4666 states. [2019-12-18 23:04:41,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4666 to 4666. [2019-12-18 23:04:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-18 23:04:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13247 transitions. [2019-12-18 23:04:41,255 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13247 transitions. Word has length 65 [2019-12-18 23:04:41,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:41,255 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13247 transitions. [2019-12-18 23:04:41,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:41,255 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13247 transitions. [2019-12-18 23:04:41,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 23:04:41,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:41,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:41,266 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:41,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:41,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1452404307, now seen corresponding path program 1 times [2019-12-18 23:04:41,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:41,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733028184] [2019-12-18 23:04:41,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:41,405 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-18 23:04:41,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733028184] [2019-12-18 23:04:41,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:41,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:04:41,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937188412] [2019-12-18 23:04:41,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:04:41,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:41,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:04:41,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:04:41,409 INFO L87 Difference]: Start difference. First operand 4666 states and 13247 transitions. Second operand 5 states. [2019-12-18 23:04:41,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:41,748 INFO L93 Difference]: Finished difference Result 6996 states and 19623 transitions. [2019-12-18 23:04:41,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:04:41,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 23:04:41,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:41,756 INFO L225 Difference]: With dead ends: 6996 [2019-12-18 23:04:41,756 INFO L226 Difference]: Without dead ends: 6996 [2019-12-18 23:04:41,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:04:41,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6996 states. [2019-12-18 23:04:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6996 to 4950. [2019-12-18 23:04:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4950 states. [2019-12-18 23:04:41,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 14092 transitions. [2019-12-18 23:04:41,830 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 14092 transitions. Word has length 66 [2019-12-18 23:04:41,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:41,831 INFO L462 AbstractCegarLoop]: Abstraction has 4950 states and 14092 transitions. [2019-12-18 23:04:41,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:04:41,831 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 14092 transitions. [2019-12-18 23:04:41,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 23:04:41,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:41,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:41,838 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:41,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:41,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1528718795, now seen corresponding path program 2 times [2019-12-18 23:04:41,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:41,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259401517] [2019-12-18 23:04:41,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:41,924 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-18 23:04:41,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259401517] [2019-12-18 23:04:41,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:41,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:04:41,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817556318] [2019-12-18 23:04:41,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:04:41,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:41,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:04:41,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:04:41,927 INFO L87 Difference]: Start difference. First operand 4950 states and 14092 transitions. Second operand 5 states. [2019-12-18 23:04:42,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:42,214 INFO L93 Difference]: Finished difference Result 7482 states and 21136 transitions. [2019-12-18 23:04:42,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:04:42,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 23:04:42,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:42,225 INFO L225 Difference]: With dead ends: 7482 [2019-12-18 23:04:42,225 INFO L226 Difference]: Without dead ends: 7482 [2019-12-18 23:04:42,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:04:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7482 states. [2019-12-18 23:04:42,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7482 to 6173. [2019-12-18 23:04:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6173 states. [2019-12-18 23:04:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6173 states to 6173 states and 17593 transitions. [2019-12-18 23:04:42,309 INFO L78 Accepts]: Start accepts. Automaton has 6173 states and 17593 transitions. Word has length 66 [2019-12-18 23:04:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:42,310 INFO L462 AbstractCegarLoop]: Abstraction has 6173 states and 17593 transitions. [2019-12-18 23:04:42,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:04:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 6173 states and 17593 transitions. [2019-12-18 23:04:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 23:04:42,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:42,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:42,318 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:42,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:42,318 INFO L82 PathProgramCache]: Analyzing trace with hash 899715013, now seen corresponding path program 3 times [2019-12-18 23:04:42,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:42,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979337200] [2019-12-18 23:04:42,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:42,444 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-18 23:04:42,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979337200] [2019-12-18 23:04:42,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:42,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:42,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845919281] [2019-12-18 23:04:42,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:42,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:42,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:42,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:42,446 INFO L87 Difference]: Start difference. First operand 6173 states and 17593 transitions. Second operand 3 states. [2019-12-18 23:04:42,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:42,506 INFO L93 Difference]: Finished difference Result 6173 states and 17592 transitions. [2019-12-18 23:04:42,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:42,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 23:04:42,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:42,515 INFO L225 Difference]: With dead ends: 6173 [2019-12-18 23:04:42,516 INFO L226 Difference]: Without dead ends: 6173 [2019-12-18 23:04:42,516 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-18 23:04:42,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6173 states. [2019-12-18 23:04:42,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6173 to 3985. [2019-12-18 23:04:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3985 states. [2019-12-18 23:04:42,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3985 states to 3985 states and 11526 transitions. [2019-12-18 23:04:42,581 INFO L78 Accepts]: Start accepts. Automaton has 3985 states and 11526 transitions. Word has length 66 [2019-12-18 23:04:42,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:42,581 INFO L462 AbstractCegarLoop]: Abstraction has 3985 states and 11526 transitions. [2019-12-18 23:04:42,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:42,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3985 states and 11526 transitions. [2019-12-18 23:04:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 23:04:42,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:42,587 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:42,587 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:42,588 INFO L82 PathProgramCache]: Analyzing trace with hash 902960793, now seen corresponding path program 1 times [2019-12-18 23:04:42,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:42,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570543693] [2019-12-18 23:04:42,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:42,692 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-18 23:04:42,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570543693] [2019-12-18 23:04:42,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:42,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:04:42,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020831275] [2019-12-18 23:04:42,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:04:42,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:42,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:04:42,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:04:42,694 INFO L87 Difference]: Start difference. First operand 3985 states and 11526 transitions. Second operand 6 states. [2019-12-18 23:04:43,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:43,280 INFO L93 Difference]: Finished difference Result 6605 states and 18735 transitions. [2019-12-18 23:04:43,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:04:43,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-18 23:04:43,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:43,290 INFO L225 Difference]: With dead ends: 6605 [2019-12-18 23:04:43,290 INFO L226 Difference]: Without dead ends: 6605 [2019-12-18 23:04:43,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:04:43,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6605 states. [2019-12-18 23:04:43,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6605 to 3985. [2019-12-18 23:04:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3985 states. [2019-12-18 23:04:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3985 states to 3985 states and 11526 transitions. [2019-12-18 23:04:43,366 INFO L78 Accepts]: Start accepts. Automaton has 3985 states and 11526 transitions. Word has length 67 [2019-12-18 23:04:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:43,367 INFO L462 AbstractCegarLoop]: Abstraction has 3985 states and 11526 transitions. [2019-12-18 23:04:43,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:04:43,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3985 states and 11526 transitions. [2019-12-18 23:04:43,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 23:04:43,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:43,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:43,373 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:43,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:43,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1012218207, now seen corresponding path program 2 times [2019-12-18 23:04:43,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:43,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201069747] [2019-12-18 23:04:43,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:43,440 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-18 23:04:43,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201069747] [2019-12-18 23:04:43,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:43,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:04:43,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578928821] [2019-12-18 23:04:43,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:04:43,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:43,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:04:43,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:04:43,442 INFO L87 Difference]: Start difference. First operand 3985 states and 11526 transitions. Second operand 3 states. [2019-12-18 23:04:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:43,464 INFO L93 Difference]: Finished difference Result 3691 states and 10435 transitions. [2019-12-18 23:04:43,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:04:43,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 23:04:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:43,470 INFO L225 Difference]: With dead ends: 3691 [2019-12-18 23:04:43,470 INFO L226 Difference]: Without dead ends: 3691 [2019-12-18 23:04:43,471 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-18 23:04:43,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3691 states. [2019-12-18 23:04:43,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3691 to 2989. [2019-12-18 23:04:43,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-12-18 23:04:43,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 8465 transitions. [2019-12-18 23:04:43,535 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 8465 transitions. Word has length 67 [2019-12-18 23:04:43,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:43,535 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 8465 transitions. [2019-12-18 23:04:43,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:04:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 8465 transitions. [2019-12-18 23:04:43,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 23:04:43,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:43,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:43,541 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:43,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:43,542 INFO L82 PathProgramCache]: Analyzing trace with hash -283246847, now seen corresponding path program 1 times [2019-12-18 23:04:43,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:43,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670782538] [2019-12-18 23:04:43,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:44,054 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-18 23:04:44,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670782538] [2019-12-18 23:04:44,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:44,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 23:04:44,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814389505] [2019-12-18 23:04:44,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 23:04:44,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:44,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 23:04:44,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-18 23:04:44,057 INFO L87 Difference]: Start difference. First operand 2989 states and 8465 transitions. Second operand 15 states. [2019-12-18 23:04:45,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:45,649 INFO L93 Difference]: Finished difference Result 8086 states and 22708 transitions. [2019-12-18 23:04:45,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 23:04:45,649 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-18 23:04:45,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:45,662 INFO L225 Difference]: With dead ends: 8086 [2019-12-18 23:04:45,662 INFO L226 Difference]: Without dead ends: 8054 [2019-12-18 23:04:45,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=1036, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 23:04:45,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8054 states. [2019-12-18 23:04:45,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8054 to 4275. [2019-12-18 23:04:45,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4275 states. [2019-12-18 23:04:45,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 12013 transitions. [2019-12-18 23:04:45,749 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 12013 transitions. Word has length 68 [2019-12-18 23:04:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:45,750 INFO L462 AbstractCegarLoop]: Abstraction has 4275 states and 12013 transitions. [2019-12-18 23:04:45,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 23:04:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 12013 transitions. [2019-12-18 23:04:45,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 23:04:45,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:45,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:45,756 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:45,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:45,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1594186905, now seen corresponding path program 2 times [2019-12-18 23:04:45,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:45,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812491545] [2019-12-18 23:04:45,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:04:46,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-18 23:04:46,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812491545] [2019-12-18 23:04:46,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:04:46,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 23:04:46,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658691756] [2019-12-18 23:04:46,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 23:04:46,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:04:46,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 23:04:46,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:04:46,229 INFO L87 Difference]: Start difference. First operand 4275 states and 12013 transitions. Second operand 12 states. [2019-12-18 23:04:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:04:46,720 INFO L93 Difference]: Finished difference Result 6822 states and 19132 transitions. [2019-12-18 23:04:46,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 23:04:46,721 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-18 23:04:46,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:04:46,730 INFO L225 Difference]: With dead ends: 6822 [2019-12-18 23:04:46,731 INFO L226 Difference]: Without dead ends: 6790 [2019-12-18 23:04:46,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 23:04:46,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6790 states. [2019-12-18 23:04:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6790 to 4144. [2019-12-18 23:04:46,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4144 states. [2019-12-18 23:04:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 11628 transitions. [2019-12-18 23:04:46,797 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 11628 transitions. Word has length 68 [2019-12-18 23:04:46,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:04:46,797 INFO L462 AbstractCegarLoop]: Abstraction has 4144 states and 11628 transitions. [2019-12-18 23:04:46,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 23:04:46,797 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 11628 transitions. [2019-12-18 23:04:46,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 23:04:46,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:04:46,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:04:46,804 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:04:46,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:04:46,805 INFO L82 PathProgramCache]: Analyzing trace with hash -812333303, now seen corresponding path program 3 times [2019-12-18 23:04:46,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:04:46,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053671609] [2019-12-18 23:04:46,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:04:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:04:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:04:46,925 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:04:46,925 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:04:46,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] ULTIMATE.startENTRY-->L803: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2495~0.base_22| 4)) (= 0 v_~z$w_buff0~0_31) (= v_~z$w_buff0_used~0_119 0) (= 0 v_~weak$$choice0~0_9) (= v_~main$tmp_guard0~0_7 0) (= v_~z$r_buff0_thd3~0_20 0) (= 0 v_~z$r_buff1_thd2~0_17) (= v_~x~0_13 0) (= v_~z$read_delayed~0_8 0) (= v_~z$read_delayed_var~0.base_8 0) (= 0 v_~weak$$choice2~0_34) (= 0 v_~z$flush_delayed~0_16) (= 0 v_~z$r_buff1_thd1~0_20) (= (select .cse0 |v_ULTIMATE.start_main_~#t2495~0.base_22|) 0) (= 0 v_~z$r_buff1_thd0~0_48) (= 0 v_~z$w_buff1_used~0_73) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2495~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2495~0.base_22|) |v_ULTIMATE.start_main_~#t2495~0.offset_17| 0)) |v_#memory_int_19|) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_ULTIMATE.start_main_~#t2495~0.offset_17|) (= v_~z$r_buff0_thd1~0_27 0) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t2495~0.base_22| 1)) (= v_~main$tmp_guard1~0_14 0) (= |v_#NULL.offset_5| 0) (= v_~z$r_buff0_thd0~0_80 0) (= v_~z$mem_tmp~0_12 0) (= v_~z~0_30 0) (= 0 v_~z$w_buff1~0_27) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2495~0.base_22|) (= v_~y~0_11 0) (= 0 v_~__unbuffered_cnt~0_18) (= v_~z$r_buff0_thd2~0_21 0) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 |v_#NULL.base_5|) (= v_~z$read_delayed_var~0.offset_8 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_7|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_15|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_9|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_14|, ULTIMATE.start_main_~#t2497~0.base=|v_ULTIMATE.start_main_~#t2497~0.base_19|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, #length=|v_#length_21|, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_73, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_16, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_11|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ULTIMATE.start_main_~#t2495~0.base=|v_ULTIMATE.start_main_~#t2495~0.base_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~x~0=v_~x~0_13, ULTIMATE.start_main_~#t2495~0.offset=|v_ULTIMATE.start_main_~#t2495~0.offset_17|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_7|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_9|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ~z$w_buff1~0=v_~z$w_buff1~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_~#t2496~0.base=|v_ULTIMATE.start_main_~#t2496~0.base_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_48, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_21, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_7|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_119, ~z$w_buff0~0=v_~z$w_buff0~0_31, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_11|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_11|, ULTIMATE.start_main_~#t2497~0.offset=|v_ULTIMATE.start_main_~#t2497~0.offset_14|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_~#t2496~0.offset=|v_ULTIMATE.start_main_~#t2496~0.offset_17|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_30, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t2497~0.base, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t2495~0.base, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2495~0.offset, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t2496~0.base, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t2497~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t2496~0.offset, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 23:04:46,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= v_~z$w_buff0_used~0_83 v_~z$w_buff1_used~0_48) (= 2 v_~z$w_buff0~0_17) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= (mod v_~z$w_buff1_used~0_48 256) 0) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~z$w_buff0_used~0_82 1) (= v_~z$w_buff0~0_18 v_~z$w_buff1~0_15) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_83, ~z$w_buff0~0=v_~z$w_buff0~0_18, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_82, ~z$w_buff0~0=v_~z$w_buff0~0_17, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_48, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~z$w_buff1~0=v_~z$w_buff1~0_15, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 23:04:46,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-2068347558 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2068347558 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-2068347558| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-2068347558| ~z$w_buff0_used~0_In-2068347558)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2068347558, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2068347558} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2068347558|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2068347558, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2068347558} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 23:04:46,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L803-1-->L805: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2496~0.base_9| 1)) (not (= |v_ULTIMATE.start_main_~#t2496~0.base_9| 0)) (= 0 |v_ULTIMATE.start_main_~#t2496~0.offset_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2496~0.base_9|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2496~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2496~0.base_9|) |v_ULTIMATE.start_main_~#t2496~0.offset_9| 1)) |v_#memory_int_11|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2496~0.base_9|) 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2496~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2496~0.offset=|v_ULTIMATE.start_main_~#t2496~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2496~0.base=|v_ULTIMATE.start_main_~#t2496~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2496~0.offset, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2496~0.base] because there is no mapped edge [2019-12-18 23:04:46,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L760-2-->L760-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1164874646 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1164874646 256)))) (or (and (= ~z~0_In-1164874646 |P1Thread1of1ForFork1_#t~ite9_Out-1164874646|) (or .cse0 .cse1)) (and (not .cse1) (= ~z$w_buff1~0_In-1164874646 |P1Thread1of1ForFork1_#t~ite9_Out-1164874646|) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1164874646, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1164874646, ~z$w_buff1~0=~z$w_buff1~0_In-1164874646, ~z~0=~z~0_In-1164874646} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1164874646|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1164874646, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1164874646, ~z$w_buff1~0=~z$w_buff1~0_In-1164874646, ~z~0=~z~0_In-1164874646} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 23:04:46,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-1-->L807: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2497~0.base_13| 1)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2497~0.base_13|)) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2497~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2497~0.base_13|) |v_ULTIMATE.start_main_~#t2497~0.offset_11| 2))) (= |v_ULTIMATE.start_main_~#t2497~0.offset_11| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2497~0.base_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2497~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t2497~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2497~0.base=|v_ULTIMATE.start_main_~#t2497~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2497~0.offset=|v_ULTIMATE.start_main_~#t2497~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2497~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2497~0.offset] because there is no mapped edge [2019-12-18 23:04:46,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L760-4-->L761: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~z~0_20) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 23:04:46,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1632644994 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1632644994 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1632644994| ~z$w_buff0_used~0_In-1632644994) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1632644994| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1632644994, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1632644994} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1632644994, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1632644994|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1632644994} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 23:04:46,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L780-2-->L780-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In614220836 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In614220836 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out614220836| ~z$w_buff1~0_In614220836)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out614220836| ~z~0_In614220836)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In614220836, ~z$w_buff1_used~0=~z$w_buff1_used~0_In614220836, ~z$w_buff1~0=~z$w_buff1~0_In614220836, ~z~0=~z~0_In614220836} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out614220836|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In614220836, ~z$w_buff1_used~0=~z$w_buff1_used~0_In614220836, ~z$w_buff1~0=~z$w_buff1~0_In614220836, ~z~0=~z~0_In614220836} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 23:04:46,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L780-4-->L781: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_21) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_21, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 23:04:46,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1142421039 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1142421039 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out-1142421039| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-1142421039| ~z$w_buff0_used~0_In-1142421039)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1142421039, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1142421039} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1142421039, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1142421039, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1142421039|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 23:04:46,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1595475822 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1595475822 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-1595475822 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1595475822 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out-1595475822| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1595475822 |P2Thread1of1ForFork2_#t~ite18_Out-1595475822|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1595475822, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1595475822, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1595475822, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1595475822} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1595475822, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1595475822, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1595475822, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1595475822, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1595475822|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 23:04:46,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L762-->L762-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In301213919 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In301213919 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In301213919 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In301213919 256)))) (or (and (= ~z$w_buff1_used~0_In301213919 |P1Thread1of1ForFork1_#t~ite12_Out301213919|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite12_Out301213919| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In301213919, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In301213919, ~z$w_buff1_used~0=~z$w_buff1_used~0_In301213919, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In301213919} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In301213919, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In301213919, ~z$w_buff1_used~0=~z$w_buff1_used~0_In301213919, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out301213919|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In301213919} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 23:04:46,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1066015542 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1066015542 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out-1066015542| ~z$r_buff0_thd3~0_In-1066015542)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out-1066015542| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1066015542, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1066015542} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1066015542, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1066015542, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1066015542|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 23:04:46,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In182919776 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In182919776 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out182919776| ~z$r_buff0_thd2~0_In182919776)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out182919776|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In182919776, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In182919776} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In182919776, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out182919776|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In182919776} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 23:04:46,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L764-->L764-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In65946662 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In65946662 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In65946662 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In65946662 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out65946662| 0)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out65946662| ~z$r_buff1_thd2~0_In65946662) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In65946662, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In65946662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In65946662, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In65946662} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In65946662, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In65946662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In65946662, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out65946662|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In65946662} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 23:04:46,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L764-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 23:04:46,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L784-->L784-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1672077399 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1672077399 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1672077399 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1672077399 256)))) (or (and (= ~z$r_buff1_thd3~0_In1672077399 |P2Thread1of1ForFork2_#t~ite20_Out1672077399|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out1672077399|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1672077399, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1672077399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1672077399, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1672077399} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1672077399, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1672077399|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1672077399, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1672077399, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1672077399} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 23:04:46,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L784-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~z$r_buff1_thd3~0_12)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 23:04:46,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In951257253 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In951257253 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In951257253 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In951257253 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out951257253| ~z$w_buff1_used~0_In951257253) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out951257253| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In951257253, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In951257253, ~z$w_buff1_used~0=~z$w_buff1_used~0_In951257253, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In951257253} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out951257253|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In951257253, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In951257253, ~z$w_buff1_used~0=~z$w_buff1_used~0_In951257253, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In951257253} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 23:04:46,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In2142317179 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In2142317179 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out2142317179 ~z$r_buff0_thd1~0_In2142317179)) (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out2142317179 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2142317179, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2142317179} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2142317179, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out2142317179|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out2142317179} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 23:04:46,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L744-->L744-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-77993437 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-77993437 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-77993437 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-77993437 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-77993437| ~z$r_buff1_thd1~0_In-77993437) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out-77993437| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-77993437, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-77993437, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-77993437, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-77993437} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-77993437, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-77993437|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-77993437, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-77993437, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-77993437} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 23:04:46,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_15)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} 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-18 23:04:46,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L807-1-->L813: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 23:04:46,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L813-2-->L813-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite25_Out835258290| |ULTIMATE.start_main_#t~ite24_Out835258290|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In835258290 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In835258290 256)))) (or (and (not .cse0) (not .cse1) .cse2 (= ~z$w_buff1~0_In835258290 |ULTIMATE.start_main_#t~ite24_Out835258290|)) (and (= |ULTIMATE.start_main_#t~ite24_Out835258290| ~z~0_In835258290) .cse2 (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In835258290, ~z$w_buff1_used~0=~z$w_buff1_used~0_In835258290, ~z$w_buff1~0=~z$w_buff1~0_In835258290, ~z~0=~z~0_In835258290} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In835258290, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out835258290|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In835258290, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out835258290|, ~z$w_buff1~0=~z$w_buff1~0_In835258290, ~z~0=~z~0_In835258290} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 23:04:46,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1868992660 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1868992660 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite26_Out-1868992660|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1868992660 |ULTIMATE.start_main_#t~ite26_Out-1868992660|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1868992660, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1868992660} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1868992660, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1868992660, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1868992660|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 23:04:46,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1080820641 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1080820641 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1080820641 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1080820641 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out-1080820641| 0)) (and (= |ULTIMATE.start_main_#t~ite27_Out-1080820641| ~z$w_buff1_used~0_In-1080820641) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1080820641, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1080820641, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1080820641, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1080820641} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1080820641, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1080820641, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1080820641, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1080820641, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1080820641|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 23:04:46,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In949107930 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In949107930 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out949107930|)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In949107930 |ULTIMATE.start_main_#t~ite28_Out949107930|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In949107930, ~z$w_buff0_used~0=~z$w_buff0_used~0_In949107930} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In949107930, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out949107930|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In949107930} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 23:04:46,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L817-->L817-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In1899209518 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In1899209518 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1899209518 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1899209518 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite29_Out1899209518|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In1899209518 |ULTIMATE.start_main_#t~ite29_Out1899209518|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1899209518, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1899209518, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1899209518, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1899209518} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1899209518, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1899209518|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1899209518, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1899209518, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1899209518} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 23:04:46,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L829-->L830: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~z$r_buff0_thd0~0_73 v_~z$r_buff0_thd0~0_72)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_72, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 23:04:46,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L832-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_25 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 23:04:46,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 23:04:47,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:04:47 BasicIcfg [2019-12-18 23:04:47,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:04:47,088 INFO L168 Benchmark]: Toolchain (without parser) took 78116.70 ms. Allocated memory was 145.8 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 102.0 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 23:04:47,089 INFO L168 Benchmark]: CDTParser took 1.39 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 23:04:47,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.22 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 156.7 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 23:04:47,090 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.16 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 154.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 23:04:47,091 INFO L168 Benchmark]: Boogie Preprocessor took 39.49 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:04:47,092 INFO L168 Benchmark]: RCFGBuilder took 842.78 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 101.3 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-18 23:04:47,092 INFO L168 Benchmark]: TraceAbstraction took 76446.34 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.3 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 23:04:47,096 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.39 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 712.22 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.8 MB in the beginning and 156.7 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.16 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 154.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.49 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 842.78 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 101.3 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 76446.34 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.3 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 173 ProgramPointsBefore, 97 ProgramPointsAfterwards, 210 TransitionsBefore, 110 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 8 FixpointIterations, 30 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 28 ChoiceCompositions, 5431 VarBasedMoverChecksPositive, 176 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 93606 CheckedPairsTotal, 107 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L803] FCALL, FORK 0 pthread_create(&t2495, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L730] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L731] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L732] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L733] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L734] 1 z$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [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, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [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 [L805] FCALL, FORK 0 pthread_create(&t2496, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2497, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L774] 3 y = 2 [L777] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L780] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L761] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L762] 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] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L763] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L783] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [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 [L813] 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}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, 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_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 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) [L814] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L815] 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 [L816] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L817] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 z$flush_delayed = weak$$choice2 [L823] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L825] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L826] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L827] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L828] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 76.1s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2469 SDtfs, 2128 SDslu, 5144 SDs, 0 SdLazy, 3218 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 25 SyntacticMatches, 12 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177949occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 32.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 49858 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 787 NumberOfCodeBlocks, 787 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 703 ConstructedInterpolants, 0 QuantifiedInterpolants, 192804 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...