/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-21 22:59:51,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-21 22:59:51,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-21 22:59:51,727 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-21 22:59:51,727 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-21 22:59:51,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-21 22:59:51,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-21 22:59:51,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-21 22:59:51,745 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-21 22:59:51,746 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-21 22:59:51,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-21 22:59:51,748 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-21 22:59:51,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-21 22:59:51,749 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-21 22:59:51,750 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-21 22:59:51,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-21 22:59:51,752 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-21 22:59:51,753 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-21 22:59:51,755 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-21 22:59:51,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-21 22:59:51,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-21 22:59:51,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-21 22:59:51,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-21 22:59:51,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-21 22:59:51,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-21 22:59:51,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-21 22:59:51,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-21 22:59:51,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-21 22:59:51,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-21 22:59:51,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-21 22:59:51,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-21 22:59:51,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-21 22:59:51,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-21 22:59:51,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-21 22:59:51,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-21 22:59:51,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-21 22:59:51,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-21 22:59:51,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-21 22:59:51,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-21 22:59:51,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-21 22:59:51,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-21 22:59:51,774 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.epf [2020-10-21 22:59:51,795 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-21 22:59:51,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-21 22:59:51,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-21 22:59:51,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-21 22:59:51,797 INFO L138 SettingsManager]: * Use SBE=true [2020-10-21 22:59:51,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-21 22:59:51,798 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-21 22:59:51,798 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-21 22:59:51,798 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-21 22:59:51,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-21 22:59:51,799 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-21 22:59:51,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-21 22:59:51,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-21 22:59:51,799 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-21 22:59:51,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-21 22:59:51,800 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-21 22:59:51,800 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-21 22:59:51,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-21 22:59:51,800 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-21 22:59:51,800 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-21 22:59:51,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-21 22:59:51,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 22:59:51,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-21 22:59:51,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-21 22:59:51,801 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-21 22:59:51,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-21 22:59:51,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-21 22:59:51,802 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-21 22:59:51,802 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-21 22:59:52,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-21 22:59:52,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-21 22:59:52,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-21 22:59:52,125 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-21 22:59:52,126 INFO L275 PluginConnector]: CDTParser initialized [2020-10-21 22:59:52,126 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_rmo.opt.i [2020-10-21 22:59:52,194 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b93e0e33a/898e4e0738a14b4c954087023270a428/FLAGb97440e1a [2020-10-21 22:59:52,754 INFO L306 CDTParser]: Found 1 translation units. [2020-10-21 22:59:52,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_rmo.opt.i [2020-10-21 22:59:52,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b93e0e33a/898e4e0738a14b4c954087023270a428/FLAGb97440e1a [2020-10-21 22:59:53,003 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b93e0e33a/898e4e0738a14b4c954087023270a428 [2020-10-21 22:59:53,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-21 22:59:53,020 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-21 22:59:53,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-21 22:59:53,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-21 22:59:53,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-21 22:59:53,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:59:53" (1/1) ... [2020-10-21 22:59:53,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73dbab58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:53, skipping insertion in model container [2020-10-21 22:59:53,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 10:59:53" (1/1) ... [2020-10-21 22:59:53,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-21 22:59:53,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-21 22:59:53,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:59:53,615 INFO L203 MainTranslator]: Completed pre-run [2020-10-21 22:59:53,680 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-21 22:59:53,766 INFO L208 MainTranslator]: Completed translation [2020-10-21 22:59:53,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:53 WrapperNode [2020-10-21 22:59:53,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-21 22:59:53,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-21 22:59:53,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-21 22:59:53,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-21 22:59:53,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:53" (1/1) ... [2020-10-21 22:59:53,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:53" (1/1) ... [2020-10-21 22:59:53,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-21 22:59:53,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-21 22:59:53,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-21 22:59:53,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-21 22:59:53,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:53" (1/1) ... [2020-10-21 22:59:53,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:53" (1/1) ... [2020-10-21 22:59:53,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:53" (1/1) ... [2020-10-21 22:59:53,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:53" (1/1) ... [2020-10-21 22:59:53,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:53" (1/1) ... [2020-10-21 22:59:53,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:53" (1/1) ... [2020-10-21 22:59:53,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:53" (1/1) ... [2020-10-21 22:59:53,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-21 22:59:53,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-21 22:59:53,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-21 22:59:53,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-21 22:59:53,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-21 22:59:53,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-21 22:59:53,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-21 22:59:53,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-21 22:59:53,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-21 22:59:53,996 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-21 22:59:53,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-21 22:59:53,996 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-21 22:59:53,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-21 22:59:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-21 22:59:53,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-21 22:59:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-21 22:59:53,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-21 22:59:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-21 22:59:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-21 22:59:53,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-21 22:59:53,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-21 22:59:54,001 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-21 22:59:55,892 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-21 22:59:55,892 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-21 22:59:55,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:59:55 BoogieIcfgContainer [2020-10-21 22:59:55,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-21 22:59:55,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-21 22:59:55,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-21 22:59:55,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-21 22:59:55,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 10:59:53" (1/3) ... [2020-10-21 22:59:55,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ad91d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:59:55, skipping insertion in model container [2020-10-21 22:59:55,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 10:59:53" (2/3) ... [2020-10-21 22:59:55,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ad91d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 10:59:55, skipping insertion in model container [2020-10-21 22:59:55,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 10:59:55" (3/3) ... [2020-10-21 22:59:55,904 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_rmo.opt.i [2020-10-21 22:59:55,915 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-21 22:59:55,916 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-21 22:59:55,924 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-21 22:59:55,925 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-21 22:59:55,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,956 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,957 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,957 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,957 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,958 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,959 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,960 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,963 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,963 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,963 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,963 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,964 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,965 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,965 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,966 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,967 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,972 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,973 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,978 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,978 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,978 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,978 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,979 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,980 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,982 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,983 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,984 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,984 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,985 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,985 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-21 22:59:55,986 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-21 22:59:56,000 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-21 22:59:56,022 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-21 22:59:56,022 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-21 22:59:56,022 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-21 22:59:56,022 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-21 22:59:56,022 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-21 22:59:56,023 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-21 22:59:56,023 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-21 22:59:56,023 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-21 22:59:56,038 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-21 22:59:56,039 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow [2020-10-21 22:59:56,042 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow [2020-10-21 22:59:56,044 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow [2020-10-21 22:59:56,102 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-10-21 22:59:56,102 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-21 22:59:56,111 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 97 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-10-21 22:59:56,122 INFO L116 LiptonReduction]: Number of co-enabled transitions 2830 [2020-10-21 22:59:56,340 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-10-21 22:59:56,822 WARN L193 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-21 22:59:58,673 WARN L193 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-10-21 22:59:58,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-10-21 22:59:58,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:59:58,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-21 22:59:58,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-21 22:59:59,571 WARN L193 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2020-10-21 23:00:00,473 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 23:00:00,604 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-21 23:00:00,844 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-10-21 23:00:02,418 WARN L193 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-10-21 23:00:02,615 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-21 23:00:02,624 INFO L131 LiptonReduction]: Checked pairs total: 7618 [2020-10-21 23:00:02,624 INFO L133 LiptonReduction]: Total number of compositions: 101 [2020-10-21 23:00:02,631 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow [2020-10-21 23:00:02,969 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4122 states. [2020-10-21 23:00:02,972 INFO L276 IsEmpty]: Start isEmpty. Operand 4122 states. [2020-10-21 23:00:02,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-21 23:00:02,986 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:02,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:02,987 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-21 23:00:02,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:02,993 INFO L82 PathProgramCache]: Analyzing trace with hash 281574382, now seen corresponding path program 1 times [2020-10-21 23:00:03,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:03,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764542989] [2020-10-21 23:00:03,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:03,305 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-21 23:00:03,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764542989] [2020-10-21 23:00:03,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:03,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-21 23:00:03,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990731631] [2020-10-21 23:00:03,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-21 23:00:03,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:03,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-21 23:00:03,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-21 23:00:03,332 INFO L87 Difference]: Start difference. First operand 4122 states. Second operand 3 states. [2020-10-21 23:00:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:03,476 INFO L93 Difference]: Finished difference Result 3562 states and 14032 transitions. [2020-10-21 23:00:03,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-21 23:00:03,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-21 23:00:03,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:03,524 INFO L225 Difference]: With dead ends: 3562 [2020-10-21 23:00:03,524 INFO L226 Difference]: Without dead ends: 2602 [2020-10-21 23:00:03,525 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-21 23:00:03,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2020-10-21 23:00:03,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2020-10-21 23:00:03,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-10-21 23:00:03,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2020-10-21 23:00:03,726 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2020-10-21 23:00:03,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:03,727 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2020-10-21 23:00:03,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-21 23:00:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2020-10-21 23:00:03,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-21 23:00:03,738 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:03,738 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:03,738 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-21 23:00:03,739 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-21 23:00:03,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:03,739 INFO L82 PathProgramCache]: Analyzing trace with hash 312586641, now seen corresponding path program 1 times [2020-10-21 23:00:03,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:03,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828605944] [2020-10-21 23:00:03,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:03,933 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-21 23:00:03,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828605944] [2020-10-21 23:00:03,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:03,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:00:03,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738813174] [2020-10-21 23:00:03,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:00:03,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:03,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:00:03,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:00:03,937 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 transitions. Second operand 4 states. [2020-10-21 23:00:04,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:04,110 INFO L93 Difference]: Finished difference Result 3062 states and 11482 transitions. [2020-10-21 23:00:04,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:04,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-21 23:00:04,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:04,135 INFO L225 Difference]: With dead ends: 3062 [2020-10-21 23:00:04,135 INFO L226 Difference]: Without dead ends: 2582 [2020-10-21 23:00:04,136 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2020-10-21 23:00:04,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 2582. [2020-10-21 23:00:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2582 states. [2020-10-21 23:00:04,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 9968 transitions. [2020-10-21 23:00:04,250 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 9968 transitions. Word has length 12 [2020-10-21 23:00:04,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:04,251 INFO L481 AbstractCegarLoop]: Abstraction has 2582 states and 9968 transitions. [2020-10-21 23:00:04,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:00:04,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 9968 transitions. [2020-10-21 23:00:04,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:00:04,254 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:04,254 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:04,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-21 23:00:04,254 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-21 23:00:04,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:04,255 INFO L82 PathProgramCache]: Analyzing trace with hash 653122455, now seen corresponding path program 1 times [2020-10-21 23:00:04,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:04,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762813869] [2020-10-21 23:00:04,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:04,350 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-21 23:00:04,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762813869] [2020-10-21 23:00:04,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:04,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-21 23:00:04,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84661100] [2020-10-21 23:00:04,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:00:04,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:04,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:00:04,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:00:04,353 INFO L87 Difference]: Start difference. First operand 2582 states and 9968 transitions. Second operand 4 states. [2020-10-21 23:00:04,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:04,452 INFO L93 Difference]: Finished difference Result 2862 states and 10732 transitions. [2020-10-21 23:00:04,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:04,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-21 23:00:04,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:04,475 INFO L225 Difference]: With dead ends: 2862 [2020-10-21 23:00:04,475 INFO L226 Difference]: Without dead ends: 2442 [2020-10-21 23:00:04,475 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-21 23:00:04,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2020-10-21 23:00:04,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2442. [2020-10-21 23:00:04,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2020-10-21 23:00:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 9376 transitions. [2020-10-21 23:00:04,570 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 9376 transitions. Word has length 13 [2020-10-21 23:00:04,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:04,570 INFO L481 AbstractCegarLoop]: Abstraction has 2442 states and 9376 transitions. [2020-10-21 23:00:04,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:00:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 9376 transitions. [2020-10-21 23:00:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-21 23:00:04,573 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:04,573 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:04,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-21 23:00:04,573 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-21 23:00:04,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:04,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1108810287, now seen corresponding path program 1 times [2020-10-21 23:00:04,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:04,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991205419] [2020-10-21 23:00:04,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:04,716 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-21 23:00:04,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991205419] [2020-10-21 23:00:04,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:04,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:00:04,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318891855] [2020-10-21 23:00:04,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:00:04,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:04,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:00:04,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:00:04,719 INFO L87 Difference]: Start difference. First operand 2442 states and 9376 transitions. Second operand 6 states. [2020-10-21 23:00:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:04,897 INFO L93 Difference]: Finished difference Result 2810 states and 10488 transitions. [2020-10-21 23:00:04,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:04,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-21 23:00:04,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:04,918 INFO L225 Difference]: With dead ends: 2810 [2020-10-21 23:00:04,918 INFO L226 Difference]: Without dead ends: 2378 [2020-10-21 23:00:04,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:00:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2020-10-21 23:00:05,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2282. [2020-10-21 23:00:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2020-10-21 23:00:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 8688 transitions. [2020-10-21 23:00:05,015 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 8688 transitions. Word has length 13 [2020-10-21 23:00:05,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:05,015 INFO L481 AbstractCegarLoop]: Abstraction has 2282 states and 8688 transitions. [2020-10-21 23:00:05,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:00:05,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 8688 transitions. [2020-10-21 23:00:05,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-21 23:00:05,018 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:05,018 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:05,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-21 23:00:05,019 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-21 23:00:05,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:05,019 INFO L82 PathProgramCache]: Analyzing trace with hash 13337626, now seen corresponding path program 1 times [2020-10-21 23:00:05,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:05,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854705999] [2020-10-21 23:00:05,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:05,141 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-21 23:00:05,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854705999] [2020-10-21 23:00:05,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:05,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:00:05,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352680348] [2020-10-21 23:00:05,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:00:05,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:05,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:00:05,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:05,144 INFO L87 Difference]: Start difference. First operand 2282 states and 8688 transitions. Second operand 5 states. [2020-10-21 23:00:05,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:05,254 INFO L93 Difference]: Finished difference Result 2586 states and 9592 transitions. [2020-10-21 23:00:05,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:05,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-21 23:00:05,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:05,275 INFO L225 Difference]: With dead ends: 2586 [2020-10-21 23:00:05,275 INFO L226 Difference]: Without dead ends: 2266 [2020-10-21 23:00:05,276 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:00:05,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2020-10-21 23:00:05,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2266. [2020-10-21 23:00:05,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2266 states. [2020-10-21 23:00:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 8608 transitions. [2020-10-21 23:00:05,430 INFO L78 Accepts]: Start accepts. Automaton has 2266 states and 8608 transitions. Word has length 14 [2020-10-21 23:00:05,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:05,431 INFO L481 AbstractCegarLoop]: Abstraction has 2266 states and 8608 transitions. [2020-10-21 23:00:05,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:00:05,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 8608 transitions. [2020-10-21 23:00:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-21 23:00:05,435 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:05,435 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:05,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-21 23:00:05,436 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-21 23:00:05,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:05,436 INFO L82 PathProgramCache]: Analyzing trace with hash 850740384, now seen corresponding path program 1 times [2020-10-21 23:00:05,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:05,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398540667] [2020-10-21 23:00:05,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:05,599 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-21 23:00:05,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398540667] [2020-10-21 23:00:05,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:05,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:00:05,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113727615] [2020-10-21 23:00:05,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:00:05,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:05,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:00:05,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:00:05,602 INFO L87 Difference]: Start difference. First operand 2266 states and 8608 transitions. Second operand 6 states. [2020-10-21 23:00:05,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:05,697 INFO L93 Difference]: Finished difference Result 2434 states and 9002 transitions. [2020-10-21 23:00:05,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:05,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-21 23:00:05,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:05,725 INFO L225 Difference]: With dead ends: 2434 [2020-10-21 23:00:05,725 INFO L226 Difference]: Without dead ends: 2154 [2020-10-21 23:00:05,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:05,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2020-10-21 23:00:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2154. [2020-10-21 23:00:05,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2020-10-21 23:00:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8112 transitions. [2020-10-21 23:00:05,797 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 8112 transitions. Word has length 15 [2020-10-21 23:00:05,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:05,797 INFO L481 AbstractCegarLoop]: Abstraction has 2154 states and 8112 transitions. [2020-10-21 23:00:05,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:00:05,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 8112 transitions. [2020-10-21 23:00:05,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-21 23:00:05,803 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:05,804 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:05,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-21 23:00:05,804 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-21 23:00:05,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:05,804 INFO L82 PathProgramCache]: Analyzing trace with hash -790387480, now seen corresponding path program 1 times [2020-10-21 23:00:05,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:05,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042499587] [2020-10-21 23:00:05,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:05,925 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-21 23:00:05,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042499587] [2020-10-21 23:00:05,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:05,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:00:05,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480240605] [2020-10-21 23:00:05,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:00:05,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:05,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:00:05,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:05,933 INFO L87 Difference]: Start difference. First operand 2154 states and 8112 transitions. Second operand 7 states. [2020-10-21 23:00:06,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:06,137 INFO L93 Difference]: Finished difference Result 2392 states and 8820 transitions. [2020-10-21 23:00:06,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-21 23:00:06,138 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-21 23:00:06,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:06,148 INFO L225 Difference]: With dead ends: 2392 [2020-10-21 23:00:06,149 INFO L226 Difference]: Without dead ends: 2128 [2020-10-21 23:00:06,149 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:00:06,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2020-10-21 23:00:06,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 2090. [2020-10-21 23:00:06,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2020-10-21 23:00:06,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7828 transitions. [2020-10-21 23:00:06,214 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7828 transitions. Word has length 16 [2020-10-21 23:00:06,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:06,215 INFO L481 AbstractCegarLoop]: Abstraction has 2090 states and 7828 transitions. [2020-10-21 23:00:06,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:00:06,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7828 transitions. [2020-10-21 23:00:06,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:00:06,220 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:06,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:06,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-21 23:00:06,220 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-21 23:00:06,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:06,221 INFO L82 PathProgramCache]: Analyzing trace with hash 794778606, now seen corresponding path program 1 times [2020-10-21 23:00:06,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:06,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762023480] [2020-10-21 23:00:06,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:06,322 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-21 23:00:06,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762023480] [2020-10-21 23:00:06,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:06,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:00:06,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736696536] [2020-10-21 23:00:06,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:00:06,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:06,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:00:06,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:06,324 INFO L87 Difference]: Start difference. First operand 2090 states and 7828 transitions. Second operand 7 states. [2020-10-21 23:00:06,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:06,460 INFO L93 Difference]: Finished difference Result 2618 states and 9758 transitions. [2020-10-21 23:00:06,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:06,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-21 23:00:06,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:06,473 INFO L225 Difference]: With dead ends: 2618 [2020-10-21 23:00:06,473 INFO L226 Difference]: Without dead ends: 2450 [2020-10-21 23:00:06,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:00:06,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2020-10-21 23:00:06,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2250. [2020-10-21 23:00:06,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2250 states. [2020-10-21 23:00:06,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2250 states to 2250 states and 8484 transitions. [2020-10-21 23:00:06,588 INFO L78 Accepts]: Start accepts. Automaton has 2250 states and 8484 transitions. Word has length 17 [2020-10-21 23:00:06,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:06,588 INFO L481 AbstractCegarLoop]: Abstraction has 2250 states and 8484 transitions. [2020-10-21 23:00:06,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:00:06,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2250 states and 8484 transitions. [2020-10-21 23:00:06,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:00:06,593 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:06,593 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:06,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-21 23:00:06,594 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-21 23:00:06,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:06,594 INFO L82 PathProgramCache]: Analyzing trace with hash 530234526, now seen corresponding path program 2 times [2020-10-21 23:00:06,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:06,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634792721] [2020-10-21 23:00:06,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:06,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-21 23:00:06,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634792721] [2020-10-21 23:00:06,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:06,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:00:06,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121285021] [2020-10-21 23:00:06,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:00:06,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:06,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:00:06,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:06,840 INFO L87 Difference]: Start difference. First operand 2250 states and 8484 transitions. Second operand 7 states. [2020-10-21 23:00:07,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:07,031 INFO L93 Difference]: Finished difference Result 2706 states and 10018 transitions. [2020-10-21 23:00:07,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:07,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-21 23:00:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:07,043 INFO L225 Difference]: With dead ends: 2706 [2020-10-21 23:00:07,043 INFO L226 Difference]: Without dead ends: 2482 [2020-10-21 23:00:07,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-21 23:00:07,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2482 states. [2020-10-21 23:00:07,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2482 to 2322. [2020-10-21 23:00:07,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2322 states. [2020-10-21 23:00:07,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 8636 transitions. [2020-10-21 23:00:07,120 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 8636 transitions. Word has length 17 [2020-10-21 23:00:07,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:07,120 INFO L481 AbstractCegarLoop]: Abstraction has 2322 states and 8636 transitions. [2020-10-21 23:00:07,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:00:07,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 8636 transitions. [2020-10-21 23:00:07,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-21 23:00:07,125 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:07,125 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:07,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-21 23:00:07,126 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-21 23:00:07,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:07,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1516381601, now seen corresponding path program 1 times [2020-10-21 23:00:07,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:07,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620972823] [2020-10-21 23:00:07,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:07,202 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-21 23:00:07,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620972823] [2020-10-21 23:00:07,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:07,203 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:00:07,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449762965] [2020-10-21 23:00:07,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:00:07,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:07,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:00:07,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:00:07,204 INFO L87 Difference]: Start difference. First operand 2322 states and 8636 transitions. Second operand 4 states. [2020-10-21 23:00:07,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:07,252 INFO L93 Difference]: Finished difference Result 2400 states and 8145 transitions. [2020-10-21 23:00:07,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:07,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-21 23:00:07,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:07,261 INFO L225 Difference]: With dead ends: 2400 [2020-10-21 23:00:07,261 INFO L226 Difference]: Without dead ends: 1824 [2020-10-21 23:00:07,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:07,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2020-10-21 23:00:07,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1824. [2020-10-21 23:00:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1824 states. [2020-10-21 23:00:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 6146 transitions. [2020-10-21 23:00:07,313 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 6146 transitions. Word has length 17 [2020-10-21 23:00:07,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:07,313 INFO L481 AbstractCegarLoop]: Abstraction has 1824 states and 6146 transitions. [2020-10-21 23:00:07,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:00:07,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 6146 transitions. [2020-10-21 23:00:07,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-21 23:00:07,317 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:07,318 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-21 23:00:07,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-21 23:00:07,318 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-21 23:00:07,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:07,318 INFO L82 PathProgramCache]: Analyzing trace with hash -594534298, now seen corresponding path program 1 times [2020-10-21 23:00:07,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:07,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340927291] [2020-10-21 23:00:07,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:07,397 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-21 23:00:07,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340927291] [2020-10-21 23:00:07,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:07,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:00:07,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936345234] [2020-10-21 23:00:07,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:00:07,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:07,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:00:07,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:07,400 INFO L87 Difference]: Start difference. First operand 1824 states and 6146 transitions. Second operand 5 states. [2020-10-21 23:00:07,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:07,456 INFO L93 Difference]: Finished difference Result 1531 states and 4708 transitions. [2020-10-21 23:00:07,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:00:07,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-21 23:00:07,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:07,461 INFO L225 Difference]: With dead ends: 1531 [2020-10-21 23:00:07,461 INFO L226 Difference]: Without dead ends: 1162 [2020-10-21 23:00:07,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:00:07,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2020-10-21 23:00:07,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1162. [2020-10-21 23:00:07,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2020-10-21 23:00:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 3498 transitions. [2020-10-21 23:00:07,492 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 3498 transitions. Word has length 18 [2020-10-21 23:00:07,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:07,492 INFO L481 AbstractCegarLoop]: Abstraction has 1162 states and 3498 transitions. [2020-10-21 23:00:07,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:00:07,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 3498 transitions. [2020-10-21 23:00:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 23:00:07,496 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:07,496 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] [2020-10-21 23:00:07,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-21 23:00:07,496 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:07,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:07,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1852182959, now seen corresponding path program 1 times [2020-10-21 23:00:07,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:07,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71213306] [2020-10-21 23:00:07,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:07,552 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-21 23:00:07,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71213306] [2020-10-21 23:00:07,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:07,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-21 23:00:07,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137981059] [2020-10-21 23:00:07,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-21 23:00:07,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:07,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-21 23:00:07,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-21 23:00:07,555 INFO L87 Difference]: Start difference. First operand 1162 states and 3498 transitions. Second operand 5 states. [2020-10-21 23:00:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:07,598 INFO L93 Difference]: Finished difference Result 1586 states and 4665 transitions. [2020-10-21 23:00:07,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:07,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-10-21 23:00:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:07,603 INFO L225 Difference]: With dead ends: 1586 [2020-10-21 23:00:07,603 INFO L226 Difference]: Without dead ends: 1042 [2020-10-21 23:00:07,603 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:07,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2020-10-21 23:00:07,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1000. [2020-10-21 23:00:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2020-10-21 23:00:07,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 2864 transitions. [2020-10-21 23:00:07,628 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 2864 transitions. Word has length 20 [2020-10-21 23:00:07,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:07,629 INFO L481 AbstractCegarLoop]: Abstraction has 1000 states and 2864 transitions. [2020-10-21 23:00:07,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-21 23:00:07,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 2864 transitions. [2020-10-21 23:00:07,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-21 23:00:07,631 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:07,631 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] [2020-10-21 23:00:07,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-21 23:00:07,632 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:07,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:07,632 INFO L82 PathProgramCache]: Analyzing trace with hash 973657478, now seen corresponding path program 1 times [2020-10-21 23:00:07,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:07,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530826753] [2020-10-21 23:00:07,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:07,718 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-21 23:00:07,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530826753] [2020-10-21 23:00:07,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:07,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:00:07,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683433310] [2020-10-21 23:00:07,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-21 23:00:07,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:07,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-21 23:00:07,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-21 23:00:07,720 INFO L87 Difference]: Start difference. First operand 1000 states and 2864 transitions. Second operand 6 states. [2020-10-21 23:00:07,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:07,780 INFO L93 Difference]: Finished difference Result 820 states and 2303 transitions. [2020-10-21 23:00:07,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-21 23:00:07,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-21 23:00:07,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:07,783 INFO L225 Difference]: With dead ends: 820 [2020-10-21 23:00:07,783 INFO L226 Difference]: Without dead ends: 718 [2020-10-21 23:00:07,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:07,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2020-10-21 23:00:07,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2020-10-21 23:00:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2020-10-21 23:00:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 2044 transitions. [2020-10-21 23:00:07,801 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 2044 transitions. Word has length 20 [2020-10-21 23:00:07,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:07,802 INFO L481 AbstractCegarLoop]: Abstraction has 718 states and 2044 transitions. [2020-10-21 23:00:07,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-21 23:00:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 2044 transitions. [2020-10-21 23:00:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-21 23:00:07,805 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:07,805 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] [2020-10-21 23:00:07,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-21 23:00:07,806 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:07,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:07,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2044334109, now seen corresponding path program 1 times [2020-10-21 23:00:07,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:07,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246756606] [2020-10-21 23:00:07,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:07,859 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-21 23:00:07,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246756606] [2020-10-21 23:00:07,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:07,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-21 23:00:07,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095552869] [2020-10-21 23:00:07,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-21 23:00:07,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:07,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-21 23:00:07,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-21 23:00:07,861 INFO L87 Difference]: Start difference. First operand 718 states and 2044 transitions. Second operand 4 states. [2020-10-21 23:00:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:07,890 INFO L93 Difference]: Finished difference Result 989 states and 2713 transitions. [2020-10-21 23:00:07,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-21 23:00:07,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-21 23:00:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:07,893 INFO L225 Difference]: With dead ends: 989 [2020-10-21 23:00:07,893 INFO L226 Difference]: Without dead ends: 657 [2020-10-21 23:00:07,894 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-21 23:00:07,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2020-10-21 23:00:07,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 629. [2020-10-21 23:00:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2020-10-21 23:00:07,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1650 transitions. [2020-10-21 23:00:07,909 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1650 transitions. Word has length 23 [2020-10-21 23:00:07,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:07,910 INFO L481 AbstractCegarLoop]: Abstraction has 629 states and 1650 transitions. [2020-10-21 23:00:07,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-21 23:00:07,910 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1650 transitions. [2020-10-21 23:00:07,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-21 23:00:07,912 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:07,912 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] [2020-10-21 23:00:07,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-21 23:00:07,912 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:07,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:07,913 INFO L82 PathProgramCache]: Analyzing trace with hash -896921053, now seen corresponding path program 2 times [2020-10-21 23:00:07,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:07,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65626015] [2020-10-21 23:00:07,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:08,079 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-21 23:00:08,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65626015] [2020-10-21 23:00:08,080 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:08,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-21 23:00:08,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639820984] [2020-10-21 23:00:08,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:00:08,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:08,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:00:08,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:08,081 INFO L87 Difference]: Start difference. First operand 629 states and 1650 transitions. Second operand 7 states. [2020-10-21 23:00:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:08,148 INFO L93 Difference]: Finished difference Result 591 states and 1574 transitions. [2020-10-21 23:00:08,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-21 23:00:08,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-21 23:00:08,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:08,150 INFO L225 Difference]: With dead ends: 591 [2020-10-21 23:00:08,150 INFO L226 Difference]: Without dead ends: 209 [2020-10-21 23:00:08,150 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-21 23:00:08,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-10-21 23:00:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 185. [2020-10-21 23:00:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-10-21 23:00:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 455 transitions. [2020-10-21 23:00:08,156 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 455 transitions. Word has length 23 [2020-10-21 23:00:08,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:08,156 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 455 transitions. [2020-10-21 23:00:08,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:00:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 455 transitions. [2020-10-21 23:00:08,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 23:00:08,157 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:08,157 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, 1, 1] [2020-10-21 23:00:08,158 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-21 23:00:08,158 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:08,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:08,158 INFO L82 PathProgramCache]: Analyzing trace with hash -967966410, now seen corresponding path program 1 times [2020-10-21 23:00:08,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:08,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811392463] [2020-10-21 23:00:08,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:08,306 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-21 23:00:08,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811392463] [2020-10-21 23:00:08,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:08,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-21 23:00:08,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643908485] [2020-10-21 23:00:08,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-21 23:00:08,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:08,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-21 23:00:08,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:00:08,308 INFO L87 Difference]: Start difference. First operand 185 states and 455 transitions. Second operand 11 states. [2020-10-21 23:00:08,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:08,629 INFO L93 Difference]: Finished difference Result 314 states and 762 transitions. [2020-10-21 23:00:08,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-21 23:00:08,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-21 23:00:08,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:08,632 INFO L225 Difference]: With dead ends: 314 [2020-10-21 23:00:08,632 INFO L226 Difference]: Without dead ends: 224 [2020-10-21 23:00:08,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-10-21 23:00:08,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-10-21 23:00:08,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 209. [2020-10-21 23:00:08,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-21 23:00:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 504 transitions. [2020-10-21 23:00:08,639 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 504 transitions. Word has length 27 [2020-10-21 23:00:08,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:08,640 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 504 transitions. [2020-10-21 23:00:08,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-21 23:00:08,640 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 504 transitions. [2020-10-21 23:00:08,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 23:00:08,641 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:08,641 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, 1, 1] [2020-10-21 23:00:08,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-21 23:00:08,641 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:08,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:08,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1291453834, now seen corresponding path program 2 times [2020-10-21 23:00:08,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:08,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616911646] [2020-10-21 23:00:08,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:08,808 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-21 23:00:08,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616911646] [2020-10-21 23:00:08,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:08,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-21 23:00:08,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066445116] [2020-10-21 23:00:08,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-21 23:00:08,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:08,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-21 23:00:08,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:00:08,810 INFO L87 Difference]: Start difference. First operand 209 states and 504 transitions. Second operand 11 states. [2020-10-21 23:00:09,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:09,029 INFO L93 Difference]: Finished difference Result 272 states and 631 transitions. [2020-10-21 23:00:09,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-21 23:00:09,029 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-21 23:00:09,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:09,030 INFO L225 Difference]: With dead ends: 272 [2020-10-21 23:00:09,031 INFO L226 Difference]: Without dead ends: 255 [2020-10-21 23:00:09,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:00:09,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-10-21 23:00:09,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 223. [2020-10-21 23:00:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-10-21 23:00:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 524 transitions. [2020-10-21 23:00:09,037 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 524 transitions. Word has length 27 [2020-10-21 23:00:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:09,038 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 524 transitions. [2020-10-21 23:00:09,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-21 23:00:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 524 transitions. [2020-10-21 23:00:09,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 23:00:09,039 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:09,039 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, 1, 1] [2020-10-21 23:00:09,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-21 23:00:09,039 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:09,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:09,040 INFO L82 PathProgramCache]: Analyzing trace with hash -109031434, now seen corresponding path program 3 times [2020-10-21 23:00:09,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:09,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419518482] [2020-10-21 23:00:09,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:09,203 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-21 23:00:09,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419518482] [2020-10-21 23:00:09,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:09,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-21 23:00:09,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857487755] [2020-10-21 23:00:09,205 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-21 23:00:09,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:09,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-21 23:00:09,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-21 23:00:09,205 INFO L87 Difference]: Start difference. First operand 223 states and 524 transitions. Second operand 11 states. [2020-10-21 23:00:09,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:09,391 INFO L93 Difference]: Finished difference Result 269 states and 616 transitions. [2020-10-21 23:00:09,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-21 23:00:09,392 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-10-21 23:00:09,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:09,393 INFO L225 Difference]: With dead ends: 269 [2020-10-21 23:00:09,393 INFO L226 Difference]: Without dead ends: 172 [2020-10-21 23:00:09,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-10-21 23:00:09,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-10-21 23:00:09,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 133. [2020-10-21 23:00:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-10-21 23:00:09,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 303 transitions. [2020-10-21 23:00:09,397 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 303 transitions. Word has length 27 [2020-10-21 23:00:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:09,398 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 303 transitions. [2020-10-21 23:00:09,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-21 23:00:09,398 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 303 transitions. [2020-10-21 23:00:09,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 23:00:09,398 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:09,399 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, 1, 1] [2020-10-21 23:00:09,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-21 23:00:09,399 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:09,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:09,399 INFO L82 PathProgramCache]: Analyzing trace with hash -175178442, now seen corresponding path program 4 times [2020-10-21 23:00:09,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:09,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600420666] [2020-10-21 23:00:09,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-21 23:00:09,521 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-21 23:00:09,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600420666] [2020-10-21 23:00:09,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-21 23:00:09,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-21 23:00:09,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499627729] [2020-10-21 23:00:09,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-21 23:00:09,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-21 23:00:09,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-21 23:00:09,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-21 23:00:09,523 INFO L87 Difference]: Start difference. First operand 133 states and 303 transitions. Second operand 7 states. [2020-10-21 23:00:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-21 23:00:09,615 INFO L93 Difference]: Finished difference Result 172 states and 384 transitions. [2020-10-21 23:00:09,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-21 23:00:09,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-10-21 23:00:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-21 23:00:09,616 INFO L225 Difference]: With dead ends: 172 [2020-10-21 23:00:09,616 INFO L226 Difference]: Without dead ends: 85 [2020-10-21 23:00:09,617 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-21 23:00:09,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-21 23:00:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-10-21 23:00:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-21 23:00:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 171 transitions. [2020-10-21 23:00:09,619 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 171 transitions. Word has length 27 [2020-10-21 23:00:09,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-21 23:00:09,620 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 171 transitions. [2020-10-21 23:00:09,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-21 23:00:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 171 transitions. [2020-10-21 23:00:09,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-21 23:00:09,620 INFO L414 BasicCegarLoop]: Found error trace [2020-10-21 23:00:09,620 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, 1, 1] [2020-10-21 23:00:09,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-21 23:00:09,621 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-21 23:00:09,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-21 23:00:09,621 INFO L82 PathProgramCache]: Analyzing trace with hash 2001350532, now seen corresponding path program 5 times [2020-10-21 23:00:09,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-21 23:00:09,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854233086] [2020-10-21 23:00:09,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-21 23:00:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:00:09,657 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:00:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-21 23:00:09,697 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-21 23:00:09,742 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-21 23:00:09,743 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-21 23:00:09,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-21 23:00:09,782 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-21 23:00:09,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,782 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-21 23:00:09,783 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [801] [2020-10-21 23:00:09,785 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-21 23:00:09,785 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,785 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-21 23:00:09,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,786 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-21 23:00:09,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,786 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-21 23:00:09,786 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,786 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-21 23:00:09,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,787 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-21 23:00:09,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,787 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-21 23:00:09,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,788 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-21 23:00:09,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,788 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-21 23:00:09,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,789 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-21 23:00:09,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,790 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-21 23:00:09,790 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,790 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-21 23:00:09,791 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,791 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-21 23:00:09,791 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,791 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-21 23:00:09,791 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,792 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-21 23:00:09,792 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,792 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-21 23:00:09,792 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,793 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-21 23:00:09,793 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,793 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-21 23:00:09,793 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,794 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-21 23:00:09,794 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,794 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-21 23:00:09,794 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,795 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-21 23:00:09,795 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,795 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-21 23:00:09,795 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,796 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-21 23:00:09,796 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,796 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-21 23:00:09,796 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,796 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-21 23:00:09,797 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,797 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-21 23:00:09,797 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,797 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-21 23:00:09,797 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-21 23:00:09,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 11:00:09 BasicIcfg [2020-10-21 23:00:09,965 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-21 23:00:09,967 INFO L168 Benchmark]: Toolchain (without parser) took 16952.59 ms. Allocated memory was 139.5 MB in the beginning and 517.5 MB in the end (delta: 378.0 MB). Free memory was 100.3 MB in the beginning and 428.6 MB in the end (delta: -328.3 MB). Peak memory consumption was 340.3 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:09,967 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 139.5 MB. Free memory was 120.9 MB in the beginning and 120.5 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-10-21 23:00:09,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.63 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 99.5 MB in the beginning and 153.3 MB in the end (delta: -53.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:09,970 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.85 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 149.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:09,970 INFO L168 Benchmark]: Boogie Preprocessor took 49.91 ms. Allocated memory is still 202.9 MB. Free memory was 149.3 MB in the beginning and 147.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:09,971 INFO L168 Benchmark]: RCFGBuilder took 1984.54 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 147.3 MB in the beginning and 180.2 MB in the end (delta: -32.9 MB). Peak memory consumption was 101.2 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:09,971 INFO L168 Benchmark]: TraceAbstraction took 14068.46 ms. Allocated memory was 247.5 MB in the beginning and 517.5 MB in the end (delta: 270.0 MB). Free memory was 180.2 MB in the beginning and 428.6 MB in the end (delta: -248.4 MB). Peak memory consumption was 312.2 MB. Max. memory is 7.1 GB. [2020-10-21 23:00:09,978 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.25 ms. Allocated memory is still 139.5 MB. Free memory was 120.9 MB in the beginning and 120.5 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 746.63 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 99.5 MB in the beginning and 153.3 MB in the end (delta: -53.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 89.85 ms. Allocated memory is still 202.9 MB. Free memory was 152.3 MB in the beginning and 149.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.91 ms. Allocated memory is still 202.9 MB. Free memory was 149.3 MB in the beginning and 147.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1984.54 ms. Allocated memory was 202.9 MB in the beginning and 247.5 MB in the end (delta: 44.6 MB). Free memory was 147.3 MB in the beginning and 180.2 MB in the end (delta: -32.9 MB). Peak memory consumption was 101.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14068.46 ms. Allocated memory was 247.5 MB in the beginning and 517.5 MB in the end (delta: 270.0 MB). Free memory was 180.2 MB in the beginning and 428.6 MB in the end (delta: -248.4 MB). Peak memory consumption was 312.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1489 VarBasedMoverChecksPositive, 31 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 169 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.5s, 131 PlacesBefore, 47 PlacesAfterwards, 121 TransitionsBefore, 35 TransitionsAfterwards, 2830 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 101 TotalNumberOfCompositions, 7618 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1181; [L847] FCALL, FORK 0 pthread_create(&t1181, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L848] 0 pthread_t t1182; [L849] FCALL, FORK 0 pthread_create(&t1182, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L850] 0 pthread_t t1183; [L851] FCALL, FORK 0 pthread_create(&t1183, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L852] 0 pthread_t t1184; [L853] FCALL, FORK 0 pthread_create(&t1184, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND TRUE 4 !expression [L17] COND FALSE 4 !(0) [L17] 4 __assert_fail ("0", "mix044_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L782] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_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=2, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_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=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 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) [L824] 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) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 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 [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 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 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix044_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_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=50, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 792 SDtfs, 875 SDslu, 2298 SDs, 0 SdLazy, 1170 SolverSat, 171 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4122occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 674 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 382 NumberOfCodeBlocks, 382 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 336 ConstructedInterpolants, 0 QuantifiedInterpolants, 43403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...