/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix039_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 01:52:27,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 01:52:27,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 01:52:27,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 01:52:27,623 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 01:52:27,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 01:52:27,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 01:52:27,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 01:52:27,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 01:52:27,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 01:52:27,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 01:52:27,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 01:52:27,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 01:52:27,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 01:52:27,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 01:52:27,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 01:52:27,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 01:52:27,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 01:52:27,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 01:52:27,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 01:52:27,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 01:52:27,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 01:52:27,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 01:52:27,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 01:52:27,680 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 01:52:27,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 01:52:27,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 01:52:27,688 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 01:52:27,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 01:52:27,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 01:52:27,689 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 01:52:27,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 01:52:27,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 01:52:27,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 01:52:27,692 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 01:52:27,695 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 01:52:27,696 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 01:52:27,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 01:52:27,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 01:52:27,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 01:52:27,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 01:52:27,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-10-22 01:52:27,736 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 01:52:27,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 01:52:27,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 01:52:27,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 01:52:27,740 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 01:52:27,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 01:52:27,741 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 01:52:27,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 01:52:27,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 01:52:27,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 01:52:27,743 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 01:52:27,743 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 01:52:27,743 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 01:52:27,743 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 01:52:27,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 01:52:27,744 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 01:52:27,744 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 01:52:27,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 01:52:27,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 01:52:27,745 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 01:52:27,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 01:52:27,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 01:52:27,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 01:52:27,745 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 01:52:27,746 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 01:52:27,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 01:52:27,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 01:52:27,746 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 01:52:27,747 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 01:52:27,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 01:52:27,747 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 01:52:28,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 01:52:28,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 01:52:28,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 01:52:28,072 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 01:52:28,072 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 01:52:28,073 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039_pso.opt.i [2020-10-22 01:52:28,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1118c3c6/b5e46a7936ec4363ae23aaa8526690a7/FLAG37143b3fa [2020-10-22 01:52:28,751 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 01:52:28,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039_pso.opt.i [2020-10-22 01:52:28,766 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1118c3c6/b5e46a7936ec4363ae23aaa8526690a7/FLAG37143b3fa [2020-10-22 01:52:28,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1118c3c6/b5e46a7936ec4363ae23aaa8526690a7 [2020-10-22 01:52:28,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 01:52:28,995 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 01:52:28,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 01:52:28,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 01:52:29,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 01:52:29,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 01:52:28" (1/1) ... [2020-10-22 01:52:29,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e75f197 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:52:29, skipping insertion in model container [2020-10-22 01:52:29,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 01:52:28" (1/1) ... [2020-10-22 01:52:29,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 01:52:29,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 01:52:29,628 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 01:52:29,642 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 01:52:29,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 01:52:29,825 INFO L208 MainTranslator]: Completed translation [2020-10-22 01:52:29,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:52:29 WrapperNode [2020-10-22 01:52:29,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 01:52:29,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 01:52:29,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 01:52:29,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 01:52:29,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:52:29" (1/1) ... [2020-10-22 01:52:29,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:52:29" (1/1) ... [2020-10-22 01:52:29,892 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 01:52:29,893 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 01:52:29,893 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 01:52:29,893 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 01:52:29,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:52:29" (1/1) ... [2020-10-22 01:52:29,905 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:52:29" (1/1) ... [2020-10-22 01:52:29,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:52:29" (1/1) ... [2020-10-22 01:52:29,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:52:29" (1/1) ... [2020-10-22 01:52:29,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:52:29" (1/1) ... [2020-10-22 01:52:29,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:52:29" (1/1) ... [2020-10-22 01:52:29,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:52:29" (1/1) ... [2020-10-22 01:52:29,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 01:52:29,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 01:52:29,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 01:52:29,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 01:52:29,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:52: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 [2020-10-22 01:52:30,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 01:52:30,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 01:52:30,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 01:52:30,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 01:52:30,010 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 01:52:30,010 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 01:52:30,010 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 01:52:30,010 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 01:52:30,011 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 01:52:30,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 01:52:30,011 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-22 01:52:30,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-22 01:52:30,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 01:52:30,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 01:52:30,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 01:52:30,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 01:52:30,015 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 01:52:31,882 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 01:52:31,882 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 01:52:31,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:52:31 BoogieIcfgContainer [2020-10-22 01:52:31,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 01:52:31,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 01:52:31,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 01:52:31,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 01:52:31,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 01:52:28" (1/3) ... [2020-10-22 01:52:31,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e59f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 01:52:31, skipping insertion in model container [2020-10-22 01:52:31,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:52:29" (2/3) ... [2020-10-22 01:52:31,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e59f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 01:52:31, skipping insertion in model container [2020-10-22 01:52:31,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:52:31" (3/3) ... [2020-10-22 01:52:31,894 INFO L111 eAbstractionObserver]: Analyzing ICFG mix039_pso.opt.i [2020-10-22 01:52:31,906 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 01:52:31,907 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 01:52:31,915 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 01:52:31,916 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 01:52:31,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,953 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,953 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,954 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,955 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,955 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,956 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,956 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,957 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,966 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,966 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,966 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,968 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,968 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,969 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,970 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,974 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,974 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,974 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,975 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,978 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,978 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,980 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,984 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,985 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,985 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,985 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,985 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,985 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,986 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,986 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,986 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,986 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,986 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,987 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,987 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,987 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,988 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,989 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:52:31,990 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 01:52:32,005 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-22 01:52:32,028 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 01:52:32,028 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 01:52:32,028 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 01:52:32,028 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 01:52:32,029 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 01:52:32,029 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 01:52:32,029 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 01:52:32,029 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 01:52:32,044 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 01:52:32,045 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow [2020-10-22 01:52:32,048 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow [2020-10-22 01:52:32,050 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow [2020-10-22 01:52:32,108 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-10-22 01:52:32,108 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 01:52:32,114 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2020-10-22 01:52:32,118 INFO L116 LiptonReduction]: Number of co-enabled transitions 2712 [2020-10-22 01:52:32,477 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2020-10-22 01:52:32,798 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-22 01:52:32,944 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-22 01:52:34,993 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-10-22 01:52:35,545 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-10-22 01:52:35,771 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-22 01:52:35,782 INFO L131 LiptonReduction]: Checked pairs total: 6469 [2020-10-22 01:52:35,783 INFO L133 LiptonReduction]: Total number of compositions: 102 [2020-10-22 01:52:35,790 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-10-22 01:52:35,931 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2410 states. [2020-10-22 01:52:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states. [2020-10-22 01:52:35,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 01:52:35,947 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:52:35,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:52:35,953 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:52:35,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:52:35,985 INFO L82 PathProgramCache]: Analyzing trace with hash -325081980, now seen corresponding path program 1 times [2020-10-22 01:52:36,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:52:36,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857545953] [2020-10-22 01:52:36,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:52:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:52:36,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:52:36,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857545953] [2020-10-22 01:52:36,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:52:36,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:52:36,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [765685173] [2020-10-22 01:52:36,300 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:52:36,304 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:52:36,319 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 01:52:36,320 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:52:36,324 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:52:36,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:52:36,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:52:36,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:52:36,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:52:36,340 INFO L87 Difference]: Start difference. First operand 2410 states. Second operand 3 states. [2020-10-22 01:52:36,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:52:36,434 INFO L93 Difference]: Finished difference Result 2090 states and 7968 transitions. [2020-10-22 01:52:36,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:52:36,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 01:52:36,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:52:36,472 INFO L225 Difference]: With dead ends: 2090 [2020-10-22 01:52:36,472 INFO L226 Difference]: Without dead ends: 1706 [2020-10-22 01:52:36,473 INFO L677 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 [2020-10-22 01:52:36,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2020-10-22 01:52:36,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1706. [2020-10-22 01:52:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2020-10-22 01:52:36,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 6400 transitions. [2020-10-22 01:52:36,621 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 6400 transitions. Word has length 9 [2020-10-22 01:52:36,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:52:36,622 INFO L481 AbstractCegarLoop]: Abstraction has 1706 states and 6400 transitions. [2020-10-22 01:52:36,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:52:36,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 6400 transitions. [2020-10-22 01:52:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 01:52:36,625 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:52:36,625 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:52:36,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 01:52:36,626 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:52:36,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:52:36,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1128908295, now seen corresponding path program 1 times [2020-10-22 01:52:36,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:52:36,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358481624] [2020-10-22 01:52:36,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:52:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:52:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:52:36,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358481624] [2020-10-22 01:52:36,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:52:36,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:52:36,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1150345904] [2020-10-22 01:52:36,716 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:52:36,717 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:52:36,721 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-22 01:52:36,721 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:52:36,722 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:52:36,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:52:36,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:52:36,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:52:36,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:52:36,731 INFO L87 Difference]: Start difference. First operand 1706 states and 6400 transitions. Second operand 3 states. [2020-10-22 01:52:36,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:52:36,761 INFO L93 Difference]: Finished difference Result 1578 states and 5856 transitions. [2020-10-22 01:52:36,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:52:36,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-22 01:52:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:52:36,777 INFO L225 Difference]: With dead ends: 1578 [2020-10-22 01:52:36,777 INFO L226 Difference]: Without dead ends: 1578 [2020-10-22 01:52:36,778 INFO L677 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 [2020-10-22 01:52:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2020-10-22 01:52:36,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2020-10-22 01:52:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1578 states. [2020-10-22 01:52:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 5856 transitions. [2020-10-22 01:52:36,844 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 5856 transitions. Word has length 11 [2020-10-22 01:52:36,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:52:36,844 INFO L481 AbstractCegarLoop]: Abstraction has 1578 states and 5856 transitions. [2020-10-22 01:52:36,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:52:36,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 5856 transitions. [2020-10-22 01:52:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 01:52:36,848 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:52:36,849 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:52:36,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 01:52:36,849 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:52:36,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:52:36,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1774254200, now seen corresponding path program 1 times [2020-10-22 01:52:36,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:52:36,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588103676] [2020-10-22 01:52:36,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:52:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:52:36,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:52:36,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588103676] [2020-10-22 01:52:36,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:52:36,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:52:36,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1238344994] [2020-10-22 01:52:36,920 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:52:36,922 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:52:36,925 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 19 transitions. [2020-10-22 01:52:36,925 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:52:36,977 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:52:36,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:52:36,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:52:36,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:52:36,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:52:36,978 INFO L87 Difference]: Start difference. First operand 1578 states and 5856 transitions. Second operand 3 states. [2020-10-22 01:52:37,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:52:37,002 INFO L93 Difference]: Finished difference Result 1546 states and 5712 transitions. [2020-10-22 01:52:37,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:52:37,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-22 01:52:37,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:52:37,017 INFO L225 Difference]: With dead ends: 1546 [2020-10-22 01:52:37,017 INFO L226 Difference]: Without dead ends: 1546 [2020-10-22 01:52:37,017 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:52:37,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2020-10-22 01:52:37,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1546. [2020-10-22 01:52:37,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2020-10-22 01:52:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 5712 transitions. [2020-10-22 01:52:37,077 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 5712 transitions. Word has length 13 [2020-10-22 01:52:37,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:52:37,077 INFO L481 AbstractCegarLoop]: Abstraction has 1546 states and 5712 transitions. [2020-10-22 01:52:37,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:52:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 5712 transitions. [2020-10-22 01:52:37,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 01:52:37,080 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:52:37,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:52:37,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 01:52:37,081 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:52:37,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:52:37,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1115864391, now seen corresponding path program 1 times [2020-10-22 01:52:37,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:52:37,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332374612] [2020-10-22 01:52:37,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:52:37,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:52:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:52:37,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332374612] [2020-10-22 01:52:37,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:52:37,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 01:52:37,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [130292211] [2020-10-22 01:52:37,146 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:52:37,148 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:52:37,153 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 41 transitions. [2020-10-22 01:52:37,153 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:52:37,361 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:52:37,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 01:52:37,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:52:37,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 01:52:37,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 01:52:37,362 INFO L87 Difference]: Start difference. First operand 1546 states and 5712 transitions. Second operand 4 states. [2020-10-22 01:52:37,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:52:37,429 INFO L93 Difference]: Finished difference Result 1597 states and 5366 transitions. [2020-10-22 01:52:37,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 01:52:37,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-22 01:52:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:52:37,440 INFO L225 Difference]: With dead ends: 1597 [2020-10-22 01:52:37,441 INFO L226 Difference]: Without dead ends: 1213 [2020-10-22 01:52:37,441 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 01:52:37,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2020-10-22 01:52:37,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1213. [2020-10-22 01:52:37,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1213 states. [2020-10-22 01:52:37,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 4047 transitions. [2020-10-22 01:52:37,492 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 4047 transitions. Word has length 14 [2020-10-22 01:52:37,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:52:37,492 INFO L481 AbstractCegarLoop]: Abstraction has 1213 states and 4047 transitions. [2020-10-22 01:52:37,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 01:52:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 4047 transitions. [2020-10-22 01:52:37,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-22 01:52:37,495 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:52:37,495 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:52:37,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 01:52:37,496 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:52:37,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:52:37,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1270128366, now seen corresponding path program 1 times [2020-10-22 01:52:37,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:52:37,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090575371] [2020-10-22 01:52:37,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:52:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:52:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:52:37,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090575371] [2020-10-22 01:52:37,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:52:37,625 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 01:52:37,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1327954809] [2020-10-22 01:52:37,625 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:52:37,628 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:52:37,635 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 58 transitions. [2020-10-22 01:52:37,636 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:52:37,770 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:52:37,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:52:37,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:52:37,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:52:37,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:52:37,772 INFO L87 Difference]: Start difference. First operand 1213 states and 4047 transitions. Second operand 3 states. [2020-10-22 01:52:37,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:52:37,802 INFO L93 Difference]: Finished difference Result 1670 states and 5410 transitions. [2020-10-22 01:52:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:52:37,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-22 01:52:37,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:52:37,812 INFO L225 Difference]: With dead ends: 1670 [2020-10-22 01:52:37,813 INFO L226 Difference]: Without dead ends: 1250 [2020-10-22 01:52:37,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:52:37,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-10-22 01:52:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1190. [2020-10-22 01:52:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1190 states. [2020-10-22 01:52:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 3784 transitions. [2020-10-22 01:52:37,856 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 3784 transitions. Word has length 16 [2020-10-22 01:52:37,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:52:37,856 INFO L481 AbstractCegarLoop]: Abstraction has 1190 states and 3784 transitions. [2020-10-22 01:52:37,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:52:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 3784 transitions. [2020-10-22 01:52:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-22 01:52:37,859 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:52:37,859 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:52:37,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 01:52:37,859 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:52:37,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:52:37,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1581653071, now seen corresponding path program 1 times [2020-10-22 01:52:37,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:52:37,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328878175] [2020-10-22 01:52:37,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:52:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:52:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:52:37,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328878175] [2020-10-22 01:52:37,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:52:37,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 01:52:37,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1287044080] [2020-10-22 01:52:37,959 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:52:37,963 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:52:37,976 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 38 transitions. [2020-10-22 01:52:37,977 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:52:38,490 WARN L193 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-22 01:52:38,759 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 3 [2020-10-22 01:52:38,835 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [27924#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 01:52:38,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 01:52:38,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:52:38,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 01:52:38,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 01:52:38,836 INFO L87 Difference]: Start difference. First operand 1190 states and 3784 transitions. Second operand 6 states. [2020-10-22 01:52:38,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:52:38,904 INFO L93 Difference]: Finished difference Result 1034 states and 2990 transitions. [2020-10-22 01:52:38,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 01:52:38,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-22 01:52:38,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:52:38,910 INFO L225 Difference]: With dead ends: 1034 [2020-10-22 01:52:38,911 INFO L226 Difference]: Without dead ends: 785 [2020-10-22 01:52:38,911 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-22 01:52:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2020-10-22 01:52:38,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2020-10-22 01:52:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-10-22 01:52:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 2226 transitions. [2020-10-22 01:52:38,934 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 2226 transitions. Word has length 16 [2020-10-22 01:52:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:52:38,934 INFO L481 AbstractCegarLoop]: Abstraction has 785 states and 2226 transitions. [2020-10-22 01:52:38,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 01:52:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 2226 transitions. [2020-10-22 01:52:38,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 01:52:38,936 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:52:38,936 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:52:38,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 01:52:38,937 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:52:38,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:52:38,937 INFO L82 PathProgramCache]: Analyzing trace with hash 493739653, now seen corresponding path program 1 times [2020-10-22 01:52:38,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:52:38,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352793576] [2020-10-22 01:52:38,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:52:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:52:39,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:52:39,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352793576] [2020-10-22 01:52:39,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:52:39,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 01:52:39,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1550099370] [2020-10-22 01:52:39,034 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:52:39,038 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:52:39,056 INFO L252 McrAutomatonBuilder]: Finished intersection with 67 states and 117 transitions. [2020-10-22 01:52:39,056 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:52:39,527 WARN L193 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 3 [2020-10-22 01:52:40,316 WARN L193 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 01:52:40,850 WARN L193 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 3 [2020-10-22 01:52:41,325 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-22 01:52:41,579 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [30537#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 01:52:41,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 01:52:41,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:52:41,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 01:52:41,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 01:52:41,581 INFO L87 Difference]: Start difference. First operand 785 states and 2226 transitions. Second operand 7 states. [2020-10-22 01:52:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:52:41,663 INFO L93 Difference]: Finished difference Result 683 states and 1898 transitions. [2020-10-22 01:52:41,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 01:52:41,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-22 01:52:41,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:52:41,674 INFO L225 Difference]: With dead ends: 683 [2020-10-22 01:52:41,674 INFO L226 Difference]: Without dead ends: 596 [2020-10-22 01:52:41,675 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 01:52:41,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-10-22 01:52:41,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2020-10-22 01:52:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2020-10-22 01:52:41,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1679 transitions. [2020-10-22 01:52:41,705 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1679 transitions. Word has length 19 [2020-10-22 01:52:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:52:41,705 INFO L481 AbstractCegarLoop]: Abstraction has 596 states and 1679 transitions. [2020-10-22 01:52:41,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 01:52:41,705 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1679 transitions. [2020-10-22 01:52:41,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 01:52:41,707 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:52:41,708 INFO L422 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] [2020-10-22 01:52:41,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 01:52:41,708 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:52:41,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:52:41,708 INFO L82 PathProgramCache]: Analyzing trace with hash 318907428, now seen corresponding path program 1 times [2020-10-22 01:52:41,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:52:41,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115123546] [2020-10-22 01:52:41,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:52:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:52:41,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:52:41,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115123546] [2020-10-22 01:52:41,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:52:41,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 01:52:41,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2092822869] [2020-10-22 01:52:41,839 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:52:41,844 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:52:41,869 INFO L252 McrAutomatonBuilder]: Finished intersection with 75 states and 128 transitions. [2020-10-22 01:52:41,869 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:52:42,156 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-22 01:52:42,560 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 3 [2020-10-22 01:52:43,240 WARN L193 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 3 [2020-10-22 01:52:43,454 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [32422#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 01:52:43,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 01:52:43,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:52:43,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 01:52:43,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 01:52:43,456 INFO L87 Difference]: Start difference. First operand 596 states and 1679 transitions. Second operand 8 states. [2020-10-22 01:52:43,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:52:43,553 INFO L93 Difference]: Finished difference Result 572 states and 1630 transitions. [2020-10-22 01:52:43,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 01:52:43,554 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2020-10-22 01:52:43,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:52:43,558 INFO L225 Difference]: With dead ends: 572 [2020-10-22 01:52:43,558 INFO L226 Difference]: Without dead ends: 365 [2020-10-22 01:52:43,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-22 01:52:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2020-10-22 01:52:43,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2020-10-22 01:52:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2020-10-22 01:52:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1003 transitions. [2020-10-22 01:52:43,569 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 1003 transitions. Word has length 22 [2020-10-22 01:52:43,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:52:43,569 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 1003 transitions. [2020-10-22 01:52:43,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 01:52:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 1003 transitions. [2020-10-22 01:52:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 01:52:43,571 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:52:43,571 INFO L422 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] [2020-10-22 01:52:43,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 01:52:43,571 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:52:43,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:52:43,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1425944362, now seen corresponding path program 1 times [2020-10-22 01:52:43,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:52:43,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766215822] [2020-10-22 01:52:43,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:52:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:52:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:52:43,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766215822] [2020-10-22 01:52:43,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:52:43,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 01:52:43,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [954280284] [2020-10-22 01:52:43,630 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:52:43,635 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:52:43,682 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 170 transitions. [2020-10-22 01:52:43,682 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:52:44,389 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-22 01:52:44,585 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 3 [2020-10-22 01:52:45,077 WARN L193 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 01:52:45,853 WARN L193 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 3 [2020-10-22 01:52:45,970 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:52:45,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 01:52:45,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:52:45,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 01:52:45,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 01:52:45,972 INFO L87 Difference]: Start difference. First operand 365 states and 1003 transitions. Second operand 4 states. [2020-10-22 01:52:45,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:52:45,997 INFO L93 Difference]: Finished difference Result 523 states and 1405 transitions. [2020-10-22 01:52:45,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 01:52:45,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-10-22 01:52:45,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:52:46,000 INFO L225 Difference]: With dead ends: 523 [2020-10-22 01:52:46,000 INFO L226 Difference]: Without dead ends: 209 [2020-10-22 01:52:46,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 01:52:46,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-10-22 01:52:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2020-10-22 01:52:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-22 01:52:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 505 transitions. [2020-10-22 01:52:46,006 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 505 transitions. Word has length 25 [2020-10-22 01:52:46,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:52:46,007 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 505 transitions. [2020-10-22 01:52:46,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 01:52:46,007 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 505 transitions. [2020-10-22 01:52:46,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 01:52:46,008 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:52:46,008 INFO L422 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] [2020-10-22 01:52:46,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 01:52:46,008 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:52:46,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:52:46,009 INFO L82 PathProgramCache]: Analyzing trace with hash -878501426, now seen corresponding path program 2 times [2020-10-22 01:52:46,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:52:46,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268771625] [2020-10-22 01:52:46,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:52:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:52:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 01:52:46,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268771625] [2020-10-22 01:52:46,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:52:46,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 01:52:46,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [205491586] [2020-10-22 01:52:46,109 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:52:46,114 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:52:46,157 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 126 transitions. [2020-10-22 01:52:46,158 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:52:46,560 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 212 [2020-10-22 01:52:46,664 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-22 01:52:46,664 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:46,665 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-10-22 01:52:46,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:46,666 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-10-22 01:52:46,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:46,668 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 01:52:46,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:46,669 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 01:52:46,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:46,671 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 01:52:46,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:46,672 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-10-22 01:52:46,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:46,674 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 01:52:46,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:46,675 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-10-22 01:52:46,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:46,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:46,684 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:46,698 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:52:46,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:52:46,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:52:46,844 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-22 01:52:46,844 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:46,845 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-22 01:52:46,845 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:46,849 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:52:46,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:46,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:46,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:46,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:46,854 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:46,861 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:46,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:46,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:46,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:46,906 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:52:46,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:46,938 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:52:46,955 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:46,990 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:52:47,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:47,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:47,020 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:52:47,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,031 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-22 01:52:47,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,190 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-22 01:52:47,191 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,191 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-22 01:52:47,192 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,193 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:52:47,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,201 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:47,206 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:52:47,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,220 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:52:47,221 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:52:47,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:52:47,230 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:47,236 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 01:52:47,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:52:47,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:47,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:47,257 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:47,261 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:47,270 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,277 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-22 01:52:47,277 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,478 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2020-10-22 01:52:47,485 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 1] term [2020-10-22 01:52:47,486 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,487 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-22 01:52:47,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,489 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:52:47,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:47,502 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:47,508 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:52:47,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,510 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:52:47,517 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:52:47,518 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:52:47,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:52:47,522 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:47,525 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:47,530 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:52:47,535 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:52:47,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:52:47,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:47,543 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:47,548 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:52:47,551 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,556 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-22 01:52:47,556 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,651 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-22 01:52:47,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,652 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-22 01:52:47,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,655 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 01:52:47,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,657 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:52:47,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,659 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:52:47,663 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:47,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:47,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:47,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:47,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:52:47,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,695 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:52:47,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:52:47,702 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:52:47,707 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:52:47,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,714 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-22 01:52:47,714 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:52:47,728 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [34680#(and (not (= ~z$w_buff0~0 0)) (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd4~0 256) 0)))] [2020-10-22 01:52:47,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 01:52:47,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:52:47,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 01:52:47,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-22 01:52:47,729 INFO L87 Difference]: Start difference. First operand 209 states and 505 transitions. Second operand 6 states. [2020-10-22 01:52:47,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:52:47,802 INFO L93 Difference]: Finished difference Result 268 states and 633 transitions. [2020-10-22 01:52:47,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 01:52:47,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-22 01:52:47,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:52:47,804 INFO L225 Difference]: With dead ends: 268 [2020-10-22 01:52:47,805 INFO L226 Difference]: Without dead ends: 222 [2020-10-22 01:52:47,805 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 01:52:47,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2020-10-22 01:52:47,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 181. [2020-10-22 01:52:47,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2020-10-22 01:52:47,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 429 transitions. [2020-10-22 01:52:47,811 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 429 transitions. Word has length 25 [2020-10-22 01:52:47,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:52:47,811 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 429 transitions. [2020-10-22 01:52:47,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 01:52:47,811 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 429 transitions. [2020-10-22 01:52:47,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-22 01:52:47,812 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:52:47,812 INFO L422 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] [2020-10-22 01:52:47,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 01:52:47,813 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:52:47,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:52:47,813 INFO L82 PathProgramCache]: Analyzing trace with hash 802109866, now seen corresponding path program 3 times [2020-10-22 01:52:47,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:52:47,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651686236] [2020-10-22 01:52:47,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:52:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 01:52:47,852 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 01:52:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 01:52:47,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 01:52:47,926 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 01:52:47,927 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 01:52:47,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 01:52:47,928 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 01:52:47,947 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L3-->L874: Formula: (let ((.cse7 (= (mod ~z$w_buff1_used~0_In-808831634 256) 0)) (.cse6 (= (mod ~z$r_buff1_thd0~0_In-808831634 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In-808831634 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In-808831634 256) 0))) (let ((.cse3 (or .cse9 .cse8)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse1 (not .cse6)) (.cse2 (not .cse7)) (.cse0 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-808831634 0)) (or (and (or (and (= ~z~0_In-808831634 ~z~0_Out-808831634) .cse0) (and (= ~z$w_buff1~0_In-808831634 ~z~0_Out-808831634) .cse1 .cse2)) .cse3) (and (= ~z~0_Out-808831634 ~z$w_buff0~0_In-808831634) .cse4 .cse5)) (= ~z$r_buff0_thd0~0_In-808831634 ~z$r_buff0_thd0~0_Out-808831634) (or (and .cse3 (= ~z$w_buff0_used~0_In-808831634 ~z$w_buff0_used~0_Out-808831634)) (and .cse4 (= ~z$w_buff0_used~0_Out-808831634 0) .cse5)) (or (and (= ~z$w_buff1_used~0_Out-808831634 0) .cse1 .cse2) (and (= ~z$w_buff1_used~0_Out-808831634 ~z$w_buff1_used~0_In-808831634) .cse0)) (= ~z$r_buff1_thd0~0_Out-808831634 ~z$r_buff1_thd0~0_In-808831634)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-808831634, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-808831634, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-808831634, ~z$w_buff0~0=~z$w_buff0~0_In-808831634, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-808831634, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-808831634, ~z$w_buff1~0=~z$w_buff1~0_In-808831634, ~z~0=~z~0_In-808831634} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-808831634, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-808831634|, ~z$w_buff0~0=~z$w_buff0~0_In-808831634, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-808831634, ~z$w_buff1~0=~z$w_buff1~0_In-808831634, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-808831634|, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-808831634|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-808831634|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-808831634, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-808831634|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-808831634|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-808831634, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-808831634, ~z~0=~z~0_Out-808831634} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite38, ~z~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2020-10-22 01:52:47,955 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:52:47,955 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [811] [2020-10-22 01:52:47,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:52:47,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:52:47,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:52:47,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:52:47,961 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:52:47,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:52:47,961 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:52:47,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:52:47,961 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:52:47,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:52:47,961 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:52:47,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:52:47,962 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:52:47,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:52:47,962 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:52:47,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:52:47,962 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:52:47,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:52:47,962 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:52:47,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:52:47,963 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:52:47,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:52:47,963 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:52:47,963 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:52:47,963 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:52:47,964 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:52:47,965 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:52:47,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:52:47,968 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 01:52:47,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:52:48,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 01:52:48 BasicIcfg [2020-10-22 01:52:48,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 01:52:48,064 INFO L168 Benchmark]: Toolchain (without parser) took 19074.54 ms. Allocated memory was 139.5 MB in the beginning and 449.8 MB in the end (delta: 310.4 MB). Free memory was 100.6 MB in the beginning and 272.0 MB in the end (delta: -171.4 MB). Peak memory consumption was 139.0 MB. Max. memory is 7.1 GB. [2020-10-22 01:52:48,065 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 139.5 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-22 01:52:48,066 INFO L168 Benchmark]: CACSL2BoogieTranslator took 830.06 ms. Allocated memory was 139.5 MB in the beginning and 201.9 MB in the end (delta: 62.4 MB). Free memory was 99.5 MB in the beginning and 152.4 MB in the end (delta: -52.8 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2020-10-22 01:52:48,066 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.24 ms. Allocated memory is still 201.9 MB. Free memory was 152.4 MB in the beginning and 149.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-22 01:52:48,067 INFO L168 Benchmark]: Boogie Preprocessor took 54.21 ms. Allocated memory is still 201.9 MB. Free memory was 149.7 MB in the beginning and 147.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-22 01:52:48,067 INFO L168 Benchmark]: RCFGBuilder took 1937.71 ms. Allocated memory was 201.9 MB in the beginning and 247.5 MB in the end (delta: 45.6 MB). Free memory was 147.0 MB in the beginning and 209.2 MB in the end (delta: -62.3 MB). Peak memory consumption was 101.5 MB. Max. memory is 7.1 GB. [2020-10-22 01:52:48,068 INFO L168 Benchmark]: TraceAbstraction took 16176.20 ms. Allocated memory was 247.5 MB in the beginning and 449.8 MB in the end (delta: 202.4 MB). Free memory was 209.2 MB in the beginning and 272.0 MB in the end (delta: -62.8 MB). Peak memory consumption was 139.6 MB. Max. memory is 7.1 GB. [2020-10-22 01:52:48,073 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 139.5 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 830.06 ms. Allocated memory was 139.5 MB in the beginning and 201.9 MB in the end (delta: 62.4 MB). Free memory was 99.5 MB in the beginning and 152.4 MB in the end (delta: -52.8 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 66.24 ms. Allocated memory is still 201.9 MB. Free memory was 152.4 MB in the beginning and 149.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.21 ms. Allocated memory is still 201.9 MB. Free memory was 149.7 MB in the beginning and 147.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1937.71 ms. Allocated memory was 201.9 MB in the beginning and 247.5 MB in the end (delta: 45.6 MB). Free memory was 147.0 MB in the beginning and 209.2 MB in the end (delta: -62.3 MB). Peak memory consumption was 101.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16176.20 ms. Allocated memory was 247.5 MB in the beginning and 449.8 MB in the end (delta: 202.4 MB). Free memory was 209.2 MB in the beginning and 272.0 MB in the end (delta: -62.8 MB). Peak memory consumption was 139.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1443 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 112 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.7s, 131 PlacesBefore, 44 PlacesAfterwards, 121 TransitionsBefore, 31 TransitionsAfterwards, 2712 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 102 TotalNumberOfCompositions, 6469 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1037; [L857] FCALL, FORK 0 pthread_create(&t1037, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 pthread_t t1038; [L859] FCALL, FORK 0 pthread_create(&t1038, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 pthread_t t1039; [L861] FCALL, FORK 0 pthread_create(&t1039, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 pthread_t t1040; [L863] FCALL, FORK 0 pthread_create(&t1040, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L784] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L796] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L796] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L797] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L834] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L876] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix039_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.9s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 324 SDtfs, 284 SDslu, 611 SDs, 0 SdLazy, 213 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 168 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2410occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 101 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 9274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...