/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/12_fmaxsymopt_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 08:22:00,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 08:22:00,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 08:22:00,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 08:22:00,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 08:22:00,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 08:22:00,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 08:22:00,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 08:22:00,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 08:22:00,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 08:22:00,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 08:22:00,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 08:22:00,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 08:22:00,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 08:22:00,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 08:22:00,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 08:22:00,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 08:22:00,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 08:22:00,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 08:22:00,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 08:22:00,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 08:22:00,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 08:22:00,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 08:22:00,690 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 08:22:00,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 08:22:00,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 08:22:00,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 08:22:00,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 08:22:00,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 08:22:00,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 08:22:00,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 08:22:00,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 08:22:00,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 08:22:00,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 08:22:00,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 08:22:00,695 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 08:22:00,696 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 08:22:00,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 08:22:00,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 08:22:00,697 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 08:22:00,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 08:22:00,698 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Separate.epf [2021-06-05 08:22:00,722 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 08:22:00,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 08:22:00,722 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 08:22:00,722 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 08:22:00,723 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 08:22:00,723 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 08:22:00,723 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 08:22:00,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 08:22:00,724 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 08:22:00,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 08:22:00,724 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 08:22:00,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 08:22:00,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 08:22:00,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 08:22:00,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 08:22:00,724 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 08:22:00,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 08:22:00,725 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 08:22:00,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 08:22:00,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 08:22:00,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 08:22:00,725 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 08:22:00,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 08:22:00,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 08:22:00,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 08:22:00,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 08:22:00,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 08:22:00,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 08:22:00,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 08:22:00,726 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 08:22:00,726 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 08:22:00,726 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 08:22:00,726 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-05 08:22:00,967 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 08:22:00,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 08:22:00,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 08:22:00,988 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 08:22:00,990 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 08:22:00,991 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/12_fmaxsymopt_cas.i [2021-06-05 08:22:01,048 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dfa4fea5/8a02341ba4de4c648d3eb4c1dac4f9ad/FLAG83e1fdab8 [2021-06-05 08:22:01,468 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 08:22:01,469 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/12_fmaxsymopt_cas.i [2021-06-05 08:22:01,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dfa4fea5/8a02341ba4de4c648d3eb4c1dac4f9ad/FLAG83e1fdab8 [2021-06-05 08:22:01,506 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dfa4fea5/8a02341ba4de4c648d3eb4c1dac4f9ad [2021-06-05 08:22:01,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 08:22:01,512 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 08:22:01,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 08:22:01,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 08:22:01,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 08:22:01,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 08:22:01" (1/1) ... [2021-06-05 08:22:01,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ef29a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:22:01, skipping insertion in model container [2021-06-05 08:22:01,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 08:22:01" (1/1) ... [2021-06-05 08:22:01,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 08:22:01,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 08:22:01,834 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/12_fmaxsymopt_cas.i[30582,30595] [2021-06-05 08:22:01,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 08:22:01,849 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 08:22:01,881 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/12_fmaxsymopt_cas.i[30582,30595] [2021-06-05 08:22:01,883 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 08:22:01,921 INFO L208 MainTranslator]: Completed translation [2021-06-05 08:22:01,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:22:01 WrapperNode [2021-06-05 08:22:01,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 08:22:01,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 08:22:01,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 08:22:01,923 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 08:22:01,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:22:01" (1/1) ... [2021-06-05 08:22:01,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:22:01" (1/1) ... [2021-06-05 08:22:01,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 08:22:01,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 08:22:01,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 08:22:01,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 08:22:01,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:22:01" (1/1) ... [2021-06-05 08:22:01,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:22:01" (1/1) ... [2021-06-05 08:22:01,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:22:01" (1/1) ... [2021-06-05 08:22:01,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:22:01" (1/1) ... [2021-06-05 08:22:01,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:22:01" (1/1) ... [2021-06-05 08:22:01,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:22:01" (1/1) ... [2021-06-05 08:22:01,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:22:01" (1/1) ... [2021-06-05 08:22:01,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 08:22:01,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 08:22:01,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 08:22:01,970 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 08:22:01,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:22:01" (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 [2021-06-05 08:22:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 08:22:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2021-06-05 08:22:02,017 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2021-06-05 08:22:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 08:22:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 08:22:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 08:22:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 08:22:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 08:22:02,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 08:22:02,018 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-05 08:22:02,408 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 08:22:02,408 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-06-05 08:22:02,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 08:22:02 BoogieIcfgContainer [2021-06-05 08:22:02,410 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 08:22:02,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 08:22:02,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 08:22:02,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 08:22:02,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 08:22:01" (1/3) ... [2021-06-05 08:22:02,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbba11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 08:22:02, skipping insertion in model container [2021-06-05 08:22:02,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:22:01" (2/3) ... [2021-06-05 08:22:02,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cbba11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 08:22:02, skipping insertion in model container [2021-06-05 08:22:02,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 08:22:02" (3/3) ... [2021-06-05 08:22:02,418 INFO L111 eAbstractionObserver]: Analyzing ICFG 12_fmaxsymopt_cas.i [2021-06-05 08:22:02,423 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 08:22:02,424 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 08:22:02,424 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 08:22:02,424 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 08:22:02,454 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,454 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,455 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,455 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,455 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,455 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,455 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,455 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,455 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,455 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,455 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,456 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,456 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,456 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,456 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,456 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,456 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,456 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,456 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,456 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,457 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,457 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,457 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,458 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,459 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,459 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,459 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,459 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,460 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,460 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,461 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,461 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,462 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,462 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,463 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,463 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,464 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,464 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,464 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,465 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,465 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,466 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,466 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,467 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,467 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,467 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,467 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,467 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,467 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,468 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,468 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,469 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,469 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,470 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,470 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,470 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,471 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,472 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,472 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,473 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~u| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,473 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~e| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,474 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,474 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~u| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,475 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~e| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,475 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,476 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,476 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,476 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,477 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,478 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,478 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,478 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,478 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,479 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,479 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,480 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,487 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,487 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,488 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~e| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,488 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,488 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,488 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,488 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,488 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~u| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,489 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,489 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,489 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,491 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,491 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,492 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,494 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,494 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,494 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,494 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,494 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,494 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,494 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,495 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,495 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:02,505 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 08:22:02,525 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 08:22:02,538 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:22:02,538 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:22:02,538 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:22:02,539 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:22:02,539 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:22:02,539 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:22:02,539 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:22:02,539 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 08:22:02,548 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 92 transitions, 189 flow [2021-06-05 08:22:02,591 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 679 states, 674 states have (on average 2.1468842729970326) internal successors, (1447), 678 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:02,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 679 states, 674 states have (on average 2.1468842729970326) internal successors, (1447), 678 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:02,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 08:22:02,609 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:02,610 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:02,610 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:02,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:02,617 INFO L82 PathProgramCache]: Analyzing trace with hash 808790187, now seen corresponding path program 1 times [2021-06-05 08:22:02,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:02,623 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135017924] [2021-06-05 08:22:02,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:02,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:22:02,767 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:02,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135017924] [2021-06-05 08:22:02,768 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135017924] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:22:02,768 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:22:02,768 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 08:22:02,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134354829] [2021-06-05 08:22:02,771 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 08:22:02,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:02,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 08:22:02,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 08:22:02,782 INFO L87 Difference]: Start difference. First operand has 679 states, 674 states have (on average 2.1468842729970326) internal successors, (1447), 678 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:02,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:02,796 INFO L93 Difference]: Finished difference Result 416 states and 791 transitions. [2021-06-05 08:22:02,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 08:22:02,797 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-06-05 08:22:02,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:02,804 INFO L225 Difference]: With dead ends: 416 [2021-06-05 08:22:02,804 INFO L226 Difference]: Without dead ends: 360 [2021-06-05 08:22:02,805 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 08:22:02,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-06-05 08:22:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2021-06-05 08:22:02,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.9108635097493036) internal successors, (686), 359 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 686 transitions. [2021-06-05 08:22:02,842 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 686 transitions. Word has length 47 [2021-06-05 08:22:02,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:02,842 INFO L482 AbstractCegarLoop]: Abstraction has 360 states and 686 transitions. [2021-06-05 08:22:02,842 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 686 transitions. [2021-06-05 08:22:02,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:22:02,844 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:02,844 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:02,844 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 08:22:02,844 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:02,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:02,845 INFO L82 PathProgramCache]: Analyzing trace with hash 278023906, now seen corresponding path program 1 times [2021-06-05 08:22:02,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:02,845 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125430588] [2021-06-05 08:22:02,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:22:02,909 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:02,909 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125430588] [2021-06-05 08:22:02,909 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125430588] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:22:02,909 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:22:02,909 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 08:22:02,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505195764] [2021-06-05 08:22:02,910 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 08:22:02,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:02,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 08:22:02,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 08:22:02,911 INFO L87 Difference]: Start difference. First operand 360 states and 686 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:02,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:02,951 INFO L93 Difference]: Finished difference Result 504 states and 964 transitions. [2021-06-05 08:22:02,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 08:22:02,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:22:02,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:02,953 INFO L225 Difference]: With dead ends: 504 [2021-06-05 08:22:02,954 INFO L226 Difference]: Without dead ends: 504 [2021-06-05 08:22:02,954 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 08:22:02,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-06-05 08:22:02,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 360. [2021-06-05 08:22:02,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.8885793871866294) internal successors, (678), 359 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 678 transitions. [2021-06-05 08:22:02,979 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 678 transitions. Word has length 48 [2021-06-05 08:22:02,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:02,979 INFO L482 AbstractCegarLoop]: Abstraction has 360 states and 678 transitions. [2021-06-05 08:22:02,979 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 678 transitions. [2021-06-05 08:22:02,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-06-05 08:22:02,981 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:02,981 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:02,982 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 08:22:02,982 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:02,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:02,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1227723128, now seen corresponding path program 1 times [2021-06-05 08:22:02,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:02,983 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721382625] [2021-06-05 08:22:02,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:22:03,030 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:03,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721382625] [2021-06-05 08:22:03,030 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721382625] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:22:03,030 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:22:03,030 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 08:22:03,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318790501] [2021-06-05 08:22:03,031 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 08:22:03,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:03,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 08:22:03,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 08:22:03,032 INFO L87 Difference]: Start difference. First operand 360 states and 678 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:03,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:03,057 INFO L93 Difference]: Finished difference Result 432 states and 821 transitions. [2021-06-05 08:22:03,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 08:22:03,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-06-05 08:22:03,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:03,060 INFO L225 Difference]: With dead ends: 432 [2021-06-05 08:22:03,060 INFO L226 Difference]: Without dead ends: 432 [2021-06-05 08:22:03,060 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 08:22:03,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-06-05 08:22:03,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 368. [2021-06-05 08:22:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 367 states have (on average 1.888283378746594) internal successors, (693), 367 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 693 transitions. [2021-06-05 08:22:03,071 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 693 transitions. Word has length 51 [2021-06-05 08:22:03,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:03,071 INFO L482 AbstractCegarLoop]: Abstraction has 368 states and 693 transitions. [2021-06-05 08:22:03,071 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 693 transitions. [2021-06-05 08:22:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 08:22:03,082 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:03,082 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:03,082 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-05 08:22:03,082 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:03,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:03,083 INFO L82 PathProgramCache]: Analyzing trace with hash -152053241, now seen corresponding path program 1 times [2021-06-05 08:22:03,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:03,083 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776178154] [2021-06-05 08:22:03,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:22:03,155 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:03,156 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776178154] [2021-06-05 08:22:03,156 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776178154] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:03,156 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164132144] [2021-06-05 08:22:03,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:22:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:03,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 08:22:03,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:22:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:22:03,407 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164132144] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:03,407 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:22:03,407 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2021-06-05 08:22:03,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350138108] [2021-06-05 08:22:03,408 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 08:22:03,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:03,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 08:22:03,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 08:22:03,412 INFO L87 Difference]: Start difference. First operand 368 states and 693 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:03,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:03,454 INFO L93 Difference]: Finished difference Result 448 states and 851 transitions. [2021-06-05 08:22:03,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 08:22:03,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-06-05 08:22:03,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:03,456 INFO L225 Difference]: With dead ends: 448 [2021-06-05 08:22:03,456 INFO L226 Difference]: Without dead ends: 448 [2021-06-05 08:22:03,456 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 18.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 08:22:03,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-06-05 08:22:03,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2021-06-05 08:22:03,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.9038031319910516) internal successors, (851), 447 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:03,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 851 transitions. [2021-06-05 08:22:03,473 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 851 transitions. Word has length 60 [2021-06-05 08:22:03,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:03,474 INFO L482 AbstractCegarLoop]: Abstraction has 448 states and 851 transitions. [2021-06-05 08:22:03,474 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:03,474 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 851 transitions. [2021-06-05 08:22:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-05 08:22:03,476 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:03,476 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:03,695 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:22:03,695 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:03,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:03,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1069235624, now seen corresponding path program 2 times [2021-06-05 08:22:03,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:03,696 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399627296] [2021-06-05 08:22:03,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:03,799 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-06-05 08:22:03,799 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:03,800 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399627296] [2021-06-05 08:22:03,800 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399627296] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:22:03,800 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:22:03,800 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:22:03,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096059992] [2021-06-05 08:22:03,800 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:22:03,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:03,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:22:03,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:22:03,801 INFO L87 Difference]: Start difference. First operand 448 states and 851 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:03,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:03,888 INFO L93 Difference]: Finished difference Result 474 states and 888 transitions. [2021-06-05 08:22:03,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 08:22:03,889 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-06-05 08:22:03,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:03,892 INFO L225 Difference]: With dead ends: 474 [2021-06-05 08:22:03,892 INFO L226 Difference]: Without dead ends: 462 [2021-06-05 08:22:03,893 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 36.0ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 08:22:03,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-06-05 08:22:03,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2021-06-05 08:22:03,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 1.8867102396514162) internal successors, (866), 459 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 866 transitions. [2021-06-05 08:22:03,905 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 866 transitions. Word has length 69 [2021-06-05 08:22:03,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:03,906 INFO L482 AbstractCegarLoop]: Abstraction has 460 states and 866 transitions. [2021-06-05 08:22:03,906 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 866 transitions. [2021-06-05 08:22:03,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 08:22:03,907 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:03,907 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:03,908 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-05 08:22:03,908 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:03,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:03,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1154088099, now seen corresponding path program 1 times [2021-06-05 08:22:03,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:03,908 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332411156] [2021-06-05 08:22:03,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:04,129 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-06-05 08:22:04,130 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:04,130 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332411156] [2021-06-05 08:22:04,132 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332411156] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:22:04,132 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:22:04,132 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:22:04,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387130777] [2021-06-05 08:22:04,132 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:22:04,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:04,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:22:04,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:22:04,134 INFO L87 Difference]: Start difference. First operand 460 states and 866 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:04,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:04,318 INFO L93 Difference]: Finished difference Result 712 states and 1334 transitions. [2021-06-05 08:22:04,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 08:22:04,318 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 08:22:04,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:04,320 INFO L225 Difference]: With dead ends: 712 [2021-06-05 08:22:04,320 INFO L226 Difference]: Without dead ends: 702 [2021-06-05 08:22:04,321 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 116.7ms TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-06-05 08:22:04,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2021-06-05 08:22:04,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 598. [2021-06-05 08:22:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.912897822445561) internal successors, (1142), 597 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:04,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1142 transitions. [2021-06-05 08:22:04,331 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1142 transitions. Word has length 73 [2021-06-05 08:22:04,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:04,331 INFO L482 AbstractCegarLoop]: Abstraction has 598 states and 1142 transitions. [2021-06-05 08:22:04,331 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:04,332 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1142 transitions. [2021-06-05 08:22:04,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 08:22:04,332 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:04,333 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:04,333 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-05 08:22:04,333 INFO L430 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:04,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:04,333 INFO L82 PathProgramCache]: Analyzing trace with hash -392061931, now seen corresponding path program 1 times [2021-06-05 08:22:04,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:04,333 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262669503] [2021-06-05 08:22:04,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 08:22:04,506 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:04,506 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262669503] [2021-06-05 08:22:04,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262669503] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:04,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260946183] [2021-06-05 08:22:04,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:22:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:04,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 08:22:04,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:22:04,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:22:04,627 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:04,630 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:04,632 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:04,632 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:22:04,673 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:22:04,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:22:04,676 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:04,681 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:04,684 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:22:04,684 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:22:04,847 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:22:04,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:22:04,850 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:04,859 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:04,866 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:22:04,868 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:22:05,187 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:22:05,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:22:05,190 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:05,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:05,201 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:05,202 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:11 [2021-06-05 08:22:05,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:22:05,282 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:05,298 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:05,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 08:22:05,304 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:05,319 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:05,320 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:22:05,320 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:44 [2021-06-05 08:22:05,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:22:05,442 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:05,445 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:05,446 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:05,446 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2021-06-05 08:22:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-06-05 08:22:05,449 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260946183] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:22:05,449 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:22:05,450 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 20 [2021-06-05 08:22:05,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114443439] [2021-06-05 08:22:05,450 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 08:22:05,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:05,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 08:22:05,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2021-06-05 08:22:05,451 INFO L87 Difference]: Start difference. First operand 598 states and 1142 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:05,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:05,920 INFO L93 Difference]: Finished difference Result 648 states and 1227 transitions. [2021-06-05 08:22:05,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 08:22:05,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 08:22:05,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:05,922 INFO L225 Difference]: With dead ends: 648 [2021-06-05 08:22:05,922 INFO L226 Difference]: Without dead ends: 508 [2021-06-05 08:22:05,923 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 543.2ms TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2021-06-05 08:22:05,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-06-05 08:22:05,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 454. [2021-06-05 08:22:05,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.8741721854304636) internal successors, (849), 453 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:05,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 849 transitions. [2021-06-05 08:22:05,930 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 849 transitions. Word has length 74 [2021-06-05 08:22:05,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:05,930 INFO L482 AbstractCegarLoop]: Abstraction has 454 states and 849 transitions. [2021-06-05 08:22:05,930 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:05,930 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 849 transitions. [2021-06-05 08:22:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-05 08:22:05,931 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:05,931 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:06,131 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:22:06,132 INFO L430 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:06,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:06,132 INFO L82 PathProgramCache]: Analyzing trace with hash 914536268, now seen corresponding path program 1 times [2021-06-05 08:22:06,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:06,132 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919251721] [2021-06-05 08:22:06,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-06-05 08:22:06,428 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:06,428 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919251721] [2021-06-05 08:22:06,428 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919251721] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:06,428 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51171759] [2021-06-05 08:22:06,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:22:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:06,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 08:22:06,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:22:06,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:22:06,561 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:06,566 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:06,567 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:06,567 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2021-06-05 08:22:06,721 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-06-05 08:22:06,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2021-06-05 08:22:06,729 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:06,749 INFO L628 ElimStorePlain]: treesize reduction 17, result has 66.0 percent of original size [2021-06-05 08:22:06,750 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:06,750 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:21 [2021-06-05 08:22:06,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:22:06,796 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:06,797 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:06,797 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:06,797 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:22:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-06-05 08:22:06,813 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51171759] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:06,813 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:22:06,813 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2021-06-05 08:22:06,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595129001] [2021-06-05 08:22:06,813 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 08:22:06,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:06,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 08:22:06,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:22:06,814 INFO L87 Difference]: Start difference. First operand 454 states and 849 transitions. Second operand has 25 states, 25 states have (on average 4.88) internal successors, (122), 25 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:09,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:09,056 INFO L93 Difference]: Finished difference Result 624 states and 1127 transitions. [2021-06-05 08:22:09,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-06-05 08:22:09,064 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.88) internal successors, (122), 25 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-06-05 08:22:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:09,066 INFO L225 Difference]: With dead ends: 624 [2021-06-05 08:22:09,066 INFO L226 Difference]: Without dead ends: 592 [2021-06-05 08:22:09,067 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 2084.5ms TimeCoverageRelationStatistics Valid=743, Invalid=3163, Unknown=0, NotChecked=0, Total=3906 [2021-06-05 08:22:09,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2021-06-05 08:22:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 474. [2021-06-05 08:22:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 1.8668076109936576) internal successors, (883), 473 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 883 transitions. [2021-06-05 08:22:09,074 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 883 transitions. Word has length 75 [2021-06-05 08:22:09,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:09,075 INFO L482 AbstractCegarLoop]: Abstraction has 474 states and 883 transitions. [2021-06-05 08:22:09,075 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 4.88) internal successors, (122), 25 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:09,075 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 883 transitions. [2021-06-05 08:22:09,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-05 08:22:09,076 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:09,076 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:09,294 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-06-05 08:22:09,295 INFO L430 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:09,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:09,295 INFO L82 PathProgramCache]: Analyzing trace with hash 2009485260, now seen corresponding path program 2 times [2021-06-05 08:22:09,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:09,295 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940391806] [2021-06-05 08:22:09,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-06-05 08:22:09,532 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:09,532 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940391806] [2021-06-05 08:22:09,532 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940391806] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:09,532 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078386190] [2021-06-05 08:22:09,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:22:09,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:22:09,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:22:09,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 08:22:09,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:22:09,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:22:09,613 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:09,615 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:09,615 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:09,615 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 08:22:09,645 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:22:09,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:22:09,647 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:09,650 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:09,651 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:22:09,651 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2021-06-05 08:22:09,719 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:22:09,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:22:09,720 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:09,724 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:09,725 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:09,725 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2021-06-05 08:22:09,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:22:09,816 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:09,820 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:09,821 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:09,821 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:7 [2021-06-05 08:22:09,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:22:09,876 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:09,877 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:09,877 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:09,878 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2021-06-05 08:22:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-06-05 08:22:09,894 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078386190] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:22:09,894 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:22:09,894 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 23 [2021-06-05 08:22:09,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259505050] [2021-06-05 08:22:09,895 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 08:22:09,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:09,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 08:22:09,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2021-06-05 08:22:09,895 INFO L87 Difference]: Start difference. First operand 474 states and 883 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:10,066 INFO L93 Difference]: Finished difference Result 484 states and 893 transitions. [2021-06-05 08:22:10,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-05 08:22:10,066 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-06-05 08:22:10,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:10,069 INFO L225 Difference]: With dead ends: 484 [2021-06-05 08:22:10,069 INFO L226 Difference]: Without dead ends: 436 [2021-06-05 08:22:10,069 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 323.2ms TimeCoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2021-06-05 08:22:10,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2021-06-05 08:22:10,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 388. [2021-06-05 08:22:10,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 1.8397932816537468) internal successors, (712), 387 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:10,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 712 transitions. [2021-06-05 08:22:10,076 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 712 transitions. Word has length 75 [2021-06-05 08:22:10,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:10,076 INFO L482 AbstractCegarLoop]: Abstraction has 388 states and 712 transitions. [2021-06-05 08:22:10,076 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 712 transitions. [2021-06-05 08:22:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 08:22:10,077 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:10,077 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:10,284 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:22:10,285 INFO L430 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:10,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:10,285 INFO L82 PathProgramCache]: Analyzing trace with hash -720785415, now seen corresponding path program 1 times [2021-06-05 08:22:10,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:10,285 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909668057] [2021-06-05 08:22:10,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:22:10,492 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:10,492 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909668057] [2021-06-05 08:22:10,493 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909668057] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:10,493 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256982351] [2021-06-05 08:22:10,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:22:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:10,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 43 conjunts are in the unsatisfiable core [2021-06-05 08:22:10,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:22:10,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:22:10,581 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:10,583 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:10,584 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:10,584 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:22:10,610 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:22:10,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:22:10,618 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:10,622 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:10,624 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:22:10,624 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:22:10,701 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:22:10,701 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:22:10,703 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:10,710 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:10,714 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:22:10,714 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:31 [2021-06-05 08:22:11,010 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:22:11,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:22:11,013 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:11,021 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:11,022 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:11,022 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:19 [2021-06-05 08:22:11,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 08:22:11,094 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:11,113 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:11,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:22:11,117 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:11,137 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:11,138 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:22:11,138 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:60 [2021-06-05 08:22:11,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:22:11,202 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:11,207 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-06-05 08:22:11,209 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:11,229 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:11,230 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:22:11,230 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:44 [2021-06-05 08:22:11,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:22:11,360 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:11,363 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:11,364 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:11,364 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2021-06-05 08:22:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-06-05 08:22:11,367 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256982351] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:11,367 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:22:11,367 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2021-06-05 08:22:11,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632522764] [2021-06-05 08:22:11,368 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 08:22:11,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:11,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 08:22:11,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:22:11,368 INFO L87 Difference]: Start difference. First operand 388 states and 712 transitions. Second operand has 25 states, 25 states have (on average 5.4) internal successors, (135), 25 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:12,543 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2021-06-05 08:22:12,685 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2021-06-05 08:22:12,833 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2021-06-05 08:22:13,012 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2021-06-05 08:22:13,158 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2021-06-05 08:22:13,312 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2021-06-05 08:22:13,454 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2021-06-05 08:22:13,591 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2021-06-05 08:22:13,746 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2021-06-05 08:22:13,887 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2021-06-05 08:22:14,030 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2021-06-05 08:22:14,209 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2021-06-05 08:22:14,346 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2021-06-05 08:22:14,484 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2021-06-05 08:22:14,634 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 62 [2021-06-05 08:22:14,756 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2021-06-05 08:22:14,903 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2021-06-05 08:22:15,042 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2021-06-05 08:22:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:15,044 INFO L93 Difference]: Finished difference Result 576 states and 1042 transitions. [2021-06-05 08:22:15,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-05 08:22:15,044 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.4) internal successors, (135), 25 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 08:22:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:15,044 INFO L225 Difference]: With dead ends: 576 [2021-06-05 08:22:15,044 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 08:22:15,045 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 3760.7ms TimeCoverageRelationStatistics Valid=841, Invalid=2129, Unknown=0, NotChecked=0, Total=2970 [2021-06-05 08:22:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 08:22:15,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 08:22:15,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:15,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 08:22:15,045 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2021-06-05 08:22:15,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:15,045 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 08:22:15,045 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 5.4) internal successors, (135), 25 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 08:22:15,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 08:22:15,253 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-06-05 08:22:15,254 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 08:22:15,255 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 08:22:15,256 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:22:15,256 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:22:15,256 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:22:15,256 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:22:15,256 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:22:15,256 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:22:15,256 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:22:15,256 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 08:22:15,257 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 92 transitions, 189 flow [2021-06-05 08:22:15,264 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 679 states, 674 states have (on average 2.1468842729970326) internal successors, (1447), 678 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 679 states, 674 states have (on average 2.1468842729970326) internal successors, (1447), 678 states have internal predecessors, (1447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-06-05 08:22:15,265 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:15,265 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:15,265 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 08:22:15,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:15,266 INFO L82 PathProgramCache]: Analyzing trace with hash -198951267, now seen corresponding path program 1 times [2021-06-05 08:22:15,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:15,266 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808043557] [2021-06-05 08:22:15,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 08:22:15,271 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 08:22:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 08:22:15,275 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 08:22:15,286 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 08:22:15,286 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 08:22:15,286 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-05 08:22:15,286 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 08:22:15,286 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 08:22:15,286 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 08:22:15,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,295 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,295 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,296 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,296 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,297 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,298 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,299 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,299 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,300 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,300 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,301 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,302 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,302 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,303 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~u| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~e| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,304 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~u| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~e| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,305 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,306 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,306 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,307 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,307 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,308 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,309 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,310 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,310 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,311 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,311 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,312 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,313 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,314 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~u| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~e| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,315 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~u| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~e| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,316 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,317 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,317 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~e| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,318 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,318 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~u| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,319 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,319 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,320 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~u| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~offset~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~e| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~v.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,321 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~e~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,321 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_~#cret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~v.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~my_max~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~v.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_findMax_#in~offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,322 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_findMax_~c~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,322 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_#in~v.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,323 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:22:15,323 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 08:22:15,324 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 08:22:15,324 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:22:15,324 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:22:15,324 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:22:15,324 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:22:15,324 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:22:15,324 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:22:15,324 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:22:15,324 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 08:22:15,326 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 136 places, 152 transitions, 316 flow [2021-06-05 08:22:17,351 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 33129 states, 33118 states have (on average 3.339211305030497) internal successors, (110588), 33128 states have internal predecessors, (110588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 33129 states, 33118 states have (on average 3.339211305030497) internal successors, (110588), 33128 states have internal predecessors, (110588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:17,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 08:22:17,410 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:17,410 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:17,410 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:17,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:17,410 INFO L82 PathProgramCache]: Analyzing trace with hash 462201892, now seen corresponding path program 1 times [2021-06-05 08:22:17,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:17,410 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112998631] [2021-06-05 08:22:17,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:22:17,420 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:17,420 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112998631] [2021-06-05 08:22:17,420 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112998631] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:22:17,421 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:22:17,421 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 08:22:17,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751510298] [2021-06-05 08:22:17,421 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 08:22:17,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:17,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 08:22:17,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 08:22:17,482 INFO L87 Difference]: Start difference. First operand has 33129 states, 33118 states have (on average 3.339211305030497) internal successors, (110588), 33128 states have internal predecessors, (110588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:17,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:17,714 INFO L93 Difference]: Finished difference Result 19575 states and 59097 transitions. [2021-06-05 08:22:17,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 08:22:17,714 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-06-05 08:22:17,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:17,807 INFO L225 Difference]: With dead ends: 19575 [2021-06-05 08:22:17,807 INFO L226 Difference]: Without dead ends: 19183 [2021-06-05 08:22:17,807 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 08:22:18,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19183 states. [2021-06-05 08:22:18,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19183 to 19183. [2021-06-05 08:22:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19183 states, 19178 states have (on average 3.0227343831473563) internal successors, (57970), 19182 states have internal predecessors, (57970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19183 states to 19183 states and 57970 transitions. [2021-06-05 08:22:18,608 INFO L78 Accepts]: Start accepts. Automaton has 19183 states and 57970 transitions. Word has length 47 [2021-06-05 08:22:18,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:18,609 INFO L482 AbstractCegarLoop]: Abstraction has 19183 states and 57970 transitions. [2021-06-05 08:22:18,609 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:18,609 INFO L276 IsEmpty]: Start isEmpty. Operand 19183 states and 57970 transitions. [2021-06-05 08:22:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-06-05 08:22:18,612 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:18,612 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:18,612 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-05 08:22:18,612 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:18,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:18,612 INFO L82 PathProgramCache]: Analyzing trace with hash -988774755, now seen corresponding path program 1 times [2021-06-05 08:22:18,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:18,612 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366593961] [2021-06-05 08:22:18,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:22:18,626 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:18,626 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366593961] [2021-06-05 08:22:18,626 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366593961] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:22:18,626 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:22:18,626 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 08:22:18,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126977257] [2021-06-05 08:22:18,626 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 08:22:18,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:18,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 08:22:18,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 08:22:18,627 INFO L87 Difference]: Start difference. First operand 19183 states and 57970 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:18,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:18,770 INFO L93 Difference]: Finished difference Result 28423 states and 85555 transitions. [2021-06-05 08:22:18,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 08:22:18,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-06-05 08:22:18,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:18,842 INFO L225 Difference]: With dead ends: 28423 [2021-06-05 08:22:18,843 INFO L226 Difference]: Without dead ends: 28423 [2021-06-05 08:22:18,843 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 08:22:19,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28423 states. [2021-06-05 08:22:19,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28423 to 19183. [2021-06-05 08:22:19,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19183 states, 19178 states have (on average 3.0019292939826885) internal successors, (57571), 19182 states have internal predecessors, (57571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:19,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19183 states to 19183 states and 57571 transitions. [2021-06-05 08:22:19,551 INFO L78 Accepts]: Start accepts. Automaton has 19183 states and 57571 transitions. Word has length 48 [2021-06-05 08:22:19,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:19,551 INFO L482 AbstractCegarLoop]: Abstraction has 19183 states and 57571 transitions. [2021-06-05 08:22:19,551 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 19183 states and 57571 transitions. [2021-06-05 08:22:19,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-06-05 08:22:19,555 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:19,555 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:19,555 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-05 08:22:19,555 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:19,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:19,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1906652752, now seen corresponding path program 1 times [2021-06-05 08:22:19,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:19,555 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848373035] [2021-06-05 08:22:19,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:22:19,573 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:19,573 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848373035] [2021-06-05 08:22:19,573 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848373035] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:22:19,573 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:22:19,573 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 08:22:19,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828178794] [2021-06-05 08:22:19,574 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 08:22:19,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:19,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 08:22:19,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 08:22:19,575 INFO L87 Difference]: Start difference. First operand 19183 states and 57571 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:19,662 INFO L93 Difference]: Finished difference Result 22774 states and 68527 transitions. [2021-06-05 08:22:19,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 08:22:19,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-06-05 08:22:19,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:19,713 INFO L225 Difference]: With dead ends: 22774 [2021-06-05 08:22:19,713 INFO L226 Difference]: Without dead ends: 22774 [2021-06-05 08:22:19,713 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 08:22:19,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22774 states. [2021-06-05 08:22:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22774 to 19582. [2021-06-05 08:22:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19582 states, 19577 states have (on average 3.0006640445420647) internal successors, (58744), 19581 states have internal predecessors, (58744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19582 states to 19582 states and 58744 transitions. [2021-06-05 08:22:20,323 INFO L78 Accepts]: Start accepts. Automaton has 19582 states and 58744 transitions. Word has length 51 [2021-06-05 08:22:20,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:20,323 INFO L482 AbstractCegarLoop]: Abstraction has 19582 states and 58744 transitions. [2021-06-05 08:22:20,323 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:20,323 INFO L276 IsEmpty]: Start isEmpty. Operand 19582 states and 58744 transitions. [2021-06-05 08:22:20,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 08:22:20,328 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:20,328 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:20,328 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-05 08:22:20,328 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:20,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:20,328 INFO L82 PathProgramCache]: Analyzing trace with hash -129369147, now seen corresponding path program 1 times [2021-06-05 08:22:20,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:20,329 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289483488] [2021-06-05 08:22:20,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:22:20,346 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:20,346 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289483488] [2021-06-05 08:22:20,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289483488] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:22:20,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:22:20,346 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 08:22:20,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658487742] [2021-06-05 08:22:20,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 08:22:20,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:20,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 08:22:20,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 08:22:20,347 INFO L87 Difference]: Start difference. First operand 19582 states and 58744 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:20,550 INFO L93 Difference]: Finished difference Result 28846 states and 86354 transitions. [2021-06-05 08:22:20,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 08:22:20,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-06-05 08:22:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:20,605 INFO L225 Difference]: With dead ends: 28846 [2021-06-05 08:22:20,605 INFO L226 Difference]: Without dead ends: 28846 [2021-06-05 08:22:20,605 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 08:22:20,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28846 states. [2021-06-05 08:22:21,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28846 to 19582. [2021-06-05 08:22:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19582 states, 19577 states have (on average 2.980231904786229) internal successors, (58344), 19581 states have internal predecessors, (58344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19582 states to 19582 states and 58344 transitions. [2021-06-05 08:22:21,169 INFO L78 Accepts]: Start accepts. Automaton has 19582 states and 58344 transitions. Word has length 55 [2021-06-05 08:22:21,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:21,170 INFO L482 AbstractCegarLoop]: Abstraction has 19582 states and 58344 transitions. [2021-06-05 08:22:21,170 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:21,170 INFO L276 IsEmpty]: Start isEmpty. Operand 19582 states and 58344 transitions. [2021-06-05 08:22:21,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-06-05 08:22:21,177 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:21,177 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:21,177 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-05 08:22:21,177 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:21,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:21,177 INFO L82 PathProgramCache]: Analyzing trace with hash -2135956659, now seen corresponding path program 1 times [2021-06-05 08:22:21,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:21,178 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716542724] [2021-06-05 08:22:21,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:22:21,194 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:21,194 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716542724] [2021-06-05 08:22:21,194 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716542724] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:22:21,194 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:22:21,194 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 08:22:21,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517824469] [2021-06-05 08:22:21,195 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 08:22:21,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:21,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 08:22:21,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 08:22:21,196 INFO L87 Difference]: Start difference. First operand 19582 states and 58344 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:21,368 INFO L93 Difference]: Finished difference Result 23182 states and 69310 transitions. [2021-06-05 08:22:21,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 08:22:21,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2021-06-05 08:22:21,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:21,402 INFO L225 Difference]: With dead ends: 23182 [2021-06-05 08:22:21,402 INFO L226 Difference]: Without dead ends: 23182 [2021-06-05 08:22:21,404 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 08:22:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23182 states. [2021-06-05 08:22:21,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23182 to 19982. [2021-06-05 08:22:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19982 states, 19977 states have (on average 2.9793262251589328) internal successors, (59518), 19981 states have internal predecessors, (59518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:21,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19982 states to 19982 states and 59518 transitions. [2021-06-05 08:22:21,931 INFO L78 Accepts]: Start accepts. Automaton has 19982 states and 59518 transitions. Word has length 58 [2021-06-05 08:22:21,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:21,931 INFO L482 AbstractCegarLoop]: Abstraction has 19982 states and 59518 transitions. [2021-06-05 08:22:21,931 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand 19982 states and 59518 transitions. [2021-06-05 08:22:21,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-05 08:22:21,943 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:21,943 INFO L521 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:21,943 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-05 08:22:21,943 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:21,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:21,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1872330626, now seen corresponding path program 1 times [2021-06-05 08:22:21,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:21,944 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443189490] [2021-06-05 08:22:21,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:22:21,966 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:21,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443189490] [2021-06-05 08:22:21,966 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443189490] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:21,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192560096] [2021-06-05 08:22:21,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:22:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:22,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 08:22:22,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:22:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:22:22,102 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192560096] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:22,102 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:22:22,102 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2021-06-05 08:22:22,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581532624] [2021-06-05 08:22:22,102 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 08:22:22,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:22,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 08:22:22,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 08:22:22,103 INFO L87 Difference]: Start difference. First operand 19982 states and 59518 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:22,195 INFO L93 Difference]: Finished difference Result 24052 states and 71805 transitions. [2021-06-05 08:22:22,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 08:22:22,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-06-05 08:22:22,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:22,235 INFO L225 Difference]: With dead ends: 24052 [2021-06-05 08:22:22,235 INFO L226 Difference]: Without dead ends: 24052 [2021-06-05 08:22:22,235 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 13.3ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 08:22:22,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24052 states. [2021-06-05 08:22:22,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24052 to 24052. [2021-06-05 08:22:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24052 states, 24047 states have (on average 2.9860273630806335) internal successors, (71805), 24051 states have internal predecessors, (71805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24052 states to 24052 states and 71805 transitions. [2021-06-05 08:22:22,787 INFO L78 Accepts]: Start accepts. Automaton has 24052 states and 71805 transitions. Word has length 60 [2021-06-05 08:22:22,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:22,787 INFO L482 AbstractCegarLoop]: Abstraction has 24052 states and 71805 transitions. [2021-06-05 08:22:22,787 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:22,787 INFO L276 IsEmpty]: Start isEmpty. Operand 24052 states and 71805 transitions. [2021-06-05 08:22:22,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-05 08:22:22,799 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:22,799 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:23,012 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-06-05 08:22:23,013 INFO L430 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:23,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:23,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1163821974, now seen corresponding path program 1 times [2021-06-05 08:22:23,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:23,014 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352061498] [2021-06-05 08:22:23,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:22:23,043 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:23,043 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352061498] [2021-06-05 08:22:23,043 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352061498] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:23,043 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96823336] [2021-06-05 08:22:23,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:22:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:23,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 08:22:23,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:22:23,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:22:23,192 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96823336] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:23,193 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:22:23,193 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2021-06-05 08:22:23,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916745223] [2021-06-05 08:22:23,193 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-05 08:22:23,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:23,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-05 08:22:23,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-05 08:22:23,194 INFO L87 Difference]: Start difference. First operand 24052 states and 71805 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:23,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:23,330 INFO L93 Difference]: Finished difference Result 28852 states and 86405 transitions. [2021-06-05 08:22:23,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 08:22:23,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-06-05 08:22:23,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:23,382 INFO L225 Difference]: With dead ends: 28852 [2021-06-05 08:22:23,382 INFO L226 Difference]: Without dead ends: 28852 [2021-06-05 08:22:23,382 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 15.0ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-05 08:22:23,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28852 states. [2021-06-05 08:22:23,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28852 to 28852. [2021-06-05 08:22:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28852 states, 28847 states have (on average 2.9952854716261657) internal successors, (86405), 28851 states have internal predecessors, (86405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28852 states to 28852 states and 86405 transitions. [2021-06-05 08:22:24,147 INFO L78 Accepts]: Start accepts. Automaton has 28852 states and 86405 transitions. Word has length 67 [2021-06-05 08:22:24,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:24,147 INFO L482 AbstractCegarLoop]: Abstraction has 28852 states and 86405 transitions. [2021-06-05 08:22:24,147 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:24,147 INFO L276 IsEmpty]: Start isEmpty. Operand 28852 states and 86405 transitions. [2021-06-05 08:22:24,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-05 08:22:24,162 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:24,162 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:24,376 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:22:24,377 INFO L430 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:24,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:24,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1950388592, now seen corresponding path program 2 times [2021-06-05 08:22:24,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:24,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373802050] [2021-06-05 08:22:24,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:24,405 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-06-05 08:22:24,406 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:24,406 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373802050] [2021-06-05 08:22:24,406 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373802050] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:22:24,406 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:22:24,406 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:22:24,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998558300] [2021-06-05 08:22:24,406 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:22:24,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:24,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:22:24,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:22:24,407 INFO L87 Difference]: Start difference. First operand 28852 states and 86405 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:24,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:24,638 INFO L93 Difference]: Finished difference Result 34817 states and 103855 transitions. [2021-06-05 08:22:24,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 08:22:24,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2021-06-05 08:22:24,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:24,695 INFO L225 Difference]: With dead ends: 34817 [2021-06-05 08:22:24,696 INFO L226 Difference]: Without dead ends: 34691 [2021-06-05 08:22:24,696 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 25.7ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 08:22:24,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34691 states. [2021-06-05 08:22:25,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34691 to 31199. [2021-06-05 08:22:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31199 states, 31194 states have (on average 3.004680387253959) internal successors, (93728), 31198 states have internal predecessors, (93728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:25,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31199 states to 31199 states and 93728 transitions. [2021-06-05 08:22:25,342 INFO L78 Accepts]: Start accepts. Automaton has 31199 states and 93728 transitions. Word has length 69 [2021-06-05 08:22:25,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:25,343 INFO L482 AbstractCegarLoop]: Abstraction has 31199 states and 93728 transitions. [2021-06-05 08:22:25,343 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 31199 states and 93728 transitions. [2021-06-05 08:22:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-05 08:22:25,355 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:25,355 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:25,355 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 08:22:25,355 INFO L430 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:25,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:25,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1259147179, now seen corresponding path program 1 times [2021-06-05 08:22:25,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:25,355 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752879406] [2021-06-05 08:22:25,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-06-05 08:22:25,447 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:25,447 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752879406] [2021-06-05 08:22:25,447 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752879406] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:22:25,447 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:22:25,447 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:22:25,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760532275] [2021-06-05 08:22:25,447 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:22:25,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:25,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:22:25,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:22:25,448 INFO L87 Difference]: Start difference. First operand 31199 states and 93728 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:26,300 INFO L93 Difference]: Finished difference Result 64121 states and 190662 transitions. [2021-06-05 08:22:26,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 08:22:26,301 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-06-05 08:22:26,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:26,425 INFO L225 Difference]: With dead ends: 64121 [2021-06-05 08:22:26,425 INFO L226 Difference]: Without dead ends: 64051 [2021-06-05 08:22:26,425 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 172.5ms TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:22:26,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64051 states. [2021-06-05 08:22:27,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64051 to 44139. [2021-06-05 08:22:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44139 states, 44134 states have (on average 3.003172157520279) internal successors, (132542), 44138 states have internal predecessors, (132542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44139 states to 44139 states and 132542 transitions. [2021-06-05 08:22:27,631 INFO L78 Accepts]: Start accepts. Automaton has 44139 states and 132542 transitions. Word has length 73 [2021-06-05 08:22:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:27,631 INFO L482 AbstractCegarLoop]: Abstraction has 44139 states and 132542 transitions. [2021-06-05 08:22:27,631 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 44139 states and 132542 transitions. [2021-06-05 08:22:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 08:22:27,644 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:27,644 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:27,644 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-05 08:22:27,644 INFO L430 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:27,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:27,644 INFO L82 PathProgramCache]: Analyzing trace with hash 646074096, now seen corresponding path program 1 times [2021-06-05 08:22:27,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:27,645 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526816225] [2021-06-05 08:22:27,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 08:22:27,743 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:27,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526816225] [2021-06-05 08:22:27,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526816225] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:27,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151712827] [2021-06-05 08:22:27,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:22:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:27,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 08:22:27,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:22:27,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:22:27,829 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:27,832 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:27,832 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:27,832 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:22:27,858 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:22:27,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:22:27,860 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:27,864 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:27,866 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:22:27,866 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:22:27,941 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:22:27,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:22:27,943 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:27,951 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:27,955 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:22:27,955 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:22:28,196 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:22:28,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:22:28,198 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:28,207 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:28,208 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:28,208 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:11 [2021-06-05 08:22:28,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:22:28,274 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:28,289 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:28,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 08:22:28,294 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:28,308 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:28,310 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:22:28,311 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:44 [2021-06-05 08:22:28,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:22:28,414 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:28,416 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:28,417 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:28,417 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2021-06-05 08:22:28,420 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-06-05 08:22:28,420 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151712827] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:22:28,420 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:22:28,420 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 20 [2021-06-05 08:22:28,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847683959] [2021-06-05 08:22:28,421 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 08:22:28,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:28,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 08:22:28,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2021-06-05 08:22:28,422 INFO L87 Difference]: Start difference. First operand 44139 states and 132542 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:31,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:31,962 INFO L93 Difference]: Finished difference Result 59673 states and 177643 transitions. [2021-06-05 08:22:31,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 08:22:31,962 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2021-06-05 08:22:31,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:32,061 INFO L225 Difference]: With dead ends: 59673 [2021-06-05 08:22:32,062 INFO L226 Difference]: Without dead ends: 58771 [2021-06-05 08:22:32,062 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 2913.4ms TimeCoverageRelationStatistics Valid=300, Invalid=1105, Unknown=1, NotChecked=0, Total=1406 [2021-06-05 08:22:32,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58771 states. [2021-06-05 08:22:33,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58771 to 46448. [2021-06-05 08:22:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46448 states, 46443 states have (on average 3.002454621794458) internal successors, (139443), 46447 states have internal predecessors, (139443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46448 states to 46448 states and 139443 transitions. [2021-06-05 08:22:33,316 INFO L78 Accepts]: Start accepts. Automaton has 46448 states and 139443 transitions. Word has length 74 [2021-06-05 08:22:33,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:33,317 INFO L482 AbstractCegarLoop]: Abstraction has 46448 states and 139443 transitions. [2021-06-05 08:22:33,317 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:33,317 INFO L276 IsEmpty]: Start isEmpty. Operand 46448 states and 139443 transitions. [2021-06-05 08:22:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-05 08:22:33,332 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:33,332 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:33,532 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-06-05 08:22:33,533 INFO L430 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:33,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:33,533 INFO L82 PathProgramCache]: Analyzing trace with hash 294853174, now seen corresponding path program 1 times [2021-06-05 08:22:33,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:33,533 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860526584] [2021-06-05 08:22:33,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-06-05 08:22:33,757 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:33,757 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860526584] [2021-06-05 08:22:33,757 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860526584] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:33,757 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467856446] [2021-06-05 08:22:33,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:22:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:33,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 08:22:33,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:22:33,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:22:33,911 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:33,915 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:33,916 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:33,917 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2021-06-05 08:22:34,048 INFO L354 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2021-06-05 08:22:34,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2021-06-05 08:22:34,066 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:34,085 INFO L628 ElimStorePlain]: treesize reduction 17, result has 66.0 percent of original size [2021-06-05 08:22:34,086 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:34,086 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:21 [2021-06-05 08:22:34,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:22:34,170 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:34,172 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:34,172 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:34,172 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:22:34,188 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-06-05 08:22:34,189 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467856446] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:34,189 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:22:34,189 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2021-06-05 08:22:34,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746067120] [2021-06-05 08:22:34,189 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 08:22:34,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:34,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 08:22:34,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:22:34,190 INFO L87 Difference]: Start difference. First operand 46448 states and 139443 transitions. Second operand has 25 states, 25 states have (on average 4.88) internal successors, (122), 25 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:42,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:42,755 INFO L93 Difference]: Finished difference Result 89998 states and 265081 transitions. [2021-06-05 08:22:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2021-06-05 08:22:42,755 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.88) internal successors, (122), 25 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-06-05 08:22:42,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:42,885 INFO L225 Difference]: With dead ends: 89998 [2021-06-05 08:22:42,885 INFO L226 Difference]: Without dead ends: 88716 [2021-06-05 08:22:42,889 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8574 ImplicationChecksByTransitivity, 5367.1ms TimeCoverageRelationStatistics Valid=3310, Invalid=19340, Unknown=0, NotChecked=0, Total=22650 [2021-06-05 08:22:43,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88716 states. [2021-06-05 08:22:43,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88716 to 49668. [2021-06-05 08:22:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49668 states, 49663 states have (on average 3.014095000302036) internal successors, (149689), 49667 states have internal predecessors, (149689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49668 states to 49668 states and 149689 transitions. [2021-06-05 08:22:44,149 INFO L78 Accepts]: Start accepts. Automaton has 49668 states and 149689 transitions. Word has length 75 [2021-06-05 08:22:44,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:44,150 INFO L482 AbstractCegarLoop]: Abstraction has 49668 states and 149689 transitions. [2021-06-05 08:22:44,150 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 4.88) internal successors, (122), 25 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 49668 states and 149689 transitions. [2021-06-05 08:22:44,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 08:22:44,164 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:44,165 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:44,368 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-06-05 08:22:44,369 INFO L430 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:44,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:44,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1329736723, now seen corresponding path program 2 times [2021-06-05 08:22:44,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:44,370 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202129888] [2021-06-05 08:22:44,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 08:22:44,402 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:44,402 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202129888] [2021-06-05 08:22:44,402 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202129888] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:22:44,402 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:22:44,402 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-05 08:22:44,402 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031317117] [2021-06-05 08:22:44,403 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-05 08:22:44,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:44,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-05 08:22:44,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-05 08:22:44,403 INFO L87 Difference]: Start difference. First operand 49668 states and 149689 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:44,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:44,713 INFO L93 Difference]: Finished difference Result 55240 states and 164689 transitions. [2021-06-05 08:22:44,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-05 08:22:44,714 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-06-05 08:22:44,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:44,810 INFO L225 Difference]: With dead ends: 55240 [2021-06-05 08:22:44,811 INFO L226 Difference]: Without dead ends: 54820 [2021-06-05 08:22:44,812 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 26.9ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-06-05 08:22:45,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54820 states. [2021-06-05 08:22:45,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54820 to 50484. [2021-06-05 08:22:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50484 states, 50479 states have (on average 3.0062600289229184) internal successors, (151753), 50483 states have internal predecessors, (151753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50484 states to 50484 states and 151753 transitions. [2021-06-05 08:22:46,236 INFO L78 Accepts]: Start accepts. Automaton has 50484 states and 151753 transitions. Word has length 76 [2021-06-05 08:22:46,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:46,237 INFO L482 AbstractCegarLoop]: Abstraction has 50484 states and 151753 transitions. [2021-06-05 08:22:46,237 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:46,237 INFO L276 IsEmpty]: Start isEmpty. Operand 50484 states and 151753 transitions. [2021-06-05 08:22:46,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 08:22:46,254 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:46,254 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:46,254 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-05 08:22:46,255 INFO L430 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:46,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:46,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1086740366, now seen corresponding path program 1 times [2021-06-05 08:22:46,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:46,255 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122425750] [2021-06-05 08:22:46,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:46,357 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-06-05 08:22:46,357 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:46,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122425750] [2021-06-05 08:22:46,357 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122425750] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:46,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960662686] [2021-06-05 08:22:46,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:22:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:46,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 08:22:46,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:22:46,578 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:22:46,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2021-06-05 08:22:46,579 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:46,597 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:46,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:22:46,601 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:46,618 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:46,621 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:22:46,621 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:50 [2021-06-05 08:22:46,749 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:46,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:22:46,752 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:22:46,765 INFO L628 ElimStorePlain]: treesize reduction 4, result has 81.8 percent of original size [2021-06-05 08:22:46,767 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:46,767 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2021-06-05 08:22:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 08:22:46,787 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960662686] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:22:46,787 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:22:46,787 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2021-06-05 08:22:46,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142709709] [2021-06-05 08:22:46,787 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 08:22:46,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:46,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 08:22:46,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-06-05 08:22:46,788 INFO L87 Difference]: Start difference. First operand 50484 states and 151753 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:22:47,878 INFO L93 Difference]: Finished difference Result 89644 states and 268056 transitions. [2021-06-05 08:22:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 08:22:47,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 08:22:47,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:22:48,016 INFO L225 Difference]: With dead ends: 89644 [2021-06-05 08:22:48,017 INFO L226 Difference]: Without dead ends: 89104 [2021-06-05 08:22:48,017 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 483.6ms TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:22:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89104 states. [2021-06-05 08:22:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89104 to 70546. [2021-06-05 08:22:49,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70546 states, 70541 states have (on average 3.0451935753675166) internal successors, (214811), 70545 states have internal predecessors, (214811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:49,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70546 states to 70546 states and 214811 transitions. [2021-06-05 08:22:49,401 INFO L78 Accepts]: Start accepts. Automaton has 70546 states and 214811 transitions. Word has length 80 [2021-06-05 08:22:49,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:22:49,401 INFO L482 AbstractCegarLoop]: Abstraction has 70546 states and 214811 transitions. [2021-06-05 08:22:49,401 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:22:49,401 INFO L276 IsEmpty]: Start isEmpty. Operand 70546 states and 214811 transitions. [2021-06-05 08:22:49,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-06-05 08:22:49,422 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:22:49,422 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:22:49,622 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:22:49,622 INFO L430 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:22:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:22:49,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1879536506, now seen corresponding path program 1 times [2021-06-05 08:22:49,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:22:49,623 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406650030] [2021-06-05 08:22:49,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:22:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 08:22:50,015 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:22:50,015 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406650030] [2021-06-05 08:22:50,015 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406650030] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:50,016 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798956439] [2021-06-05 08:22:50,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:22:50,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:22:50,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 38 conjunts are in the unsatisfiable core [2021-06-05 08:22:50,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:22:50,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:22:50,106 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:50,109 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:50,109 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:50,109 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:22:50,135 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:22:50,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:22:50,137 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:50,141 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:50,142 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:22:50,142 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:22:50,228 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:22:50,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:22:50,230 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:50,237 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:50,239 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:22:50,239 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:31 [2021-06-05 08:22:50,408 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:22:50,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:22:50,410 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:50,419 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:50,420 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:50,420 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:19 [2021-06-05 08:22:50,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 08:22:50,494 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:50,515 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:50,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:22:50,520 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:50,540 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:50,542 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:22:50,542 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:60 [2021-06-05 08:22:50,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-06-05 08:22:50,650 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:50,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2021-06-05 08:22:50,656 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:50,676 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:50,678 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:22:50,678 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:90, output treesize:48 [2021-06-05 08:22:50,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:22:50,770 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:22:50,773 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:22:50,774 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:22:50,774 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2021-06-05 08:22:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-06-05 08:22:50,777 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798956439] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:22:50,777 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:22:50,777 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2021-06-05 08:22:50,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395192201] [2021-06-05 08:22:50,778 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 08:22:50,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:22:50,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 08:22:50,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2021-06-05 08:22:50,778 INFO L87 Difference]: Start difference. First operand 70546 states and 214811 transitions. Second operand has 23 states, 23 states have (on average 5.869565217391305) internal successors, (135), 23 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:00,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:23:00,991 INFO L93 Difference]: Finished difference Result 151651 states and 456093 transitions. [2021-06-05 08:23:00,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2021-06-05 08:23:00,991 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.869565217391305) internal successors, (135), 23 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-06-05 08:23:00,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:23:01,225 INFO L225 Difference]: With dead ends: 151651 [2021-06-05 08:23:01,225 INFO L226 Difference]: Without dead ends: 142171 [2021-06-05 08:23:01,229 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8332 ImplicationChecksByTransitivity, 7824.7ms TimeCoverageRelationStatistics Valid=3726, Invalid=17444, Unknown=0, NotChecked=0, Total=21170 [2021-06-05 08:23:01,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142171 states. [2021-06-05 08:23:02,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142171 to 62411. [2021-06-05 08:23:02,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62411 states, 62407 states have (on average 3.0233467399490443) internal successors, (188678), 62410 states have internal predecessors, (188678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62411 states to 62411 states and 188678 transitions. [2021-06-05 08:23:02,891 INFO L78 Accepts]: Start accepts. Automaton has 62411 states and 188678 transitions. Word has length 80 [2021-06-05 08:23:02,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:23:02,891 INFO L482 AbstractCegarLoop]: Abstraction has 62411 states and 188678 transitions. [2021-06-05 08:23:02,891 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 5.869565217391305) internal successors, (135), 23 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 62411 states and 188678 transitions. [2021-06-05 08:23:02,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-05 08:23:02,912 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:23:02,913 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:23:03,117 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-06-05 08:23:03,117 INFO L430 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:23:03,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:23:03,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1695717944, now seen corresponding path program 1 times [2021-06-05 08:23:03,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:23:03,118 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413139188] [2021-06-05 08:23:03,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:23:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:23:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 08:23:03,490 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:23:03,490 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413139188] [2021-06-05 08:23:03,491 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413139188] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:23:03,491 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024625104] [2021-06-05 08:23:03,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:23:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:23:03,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 08:23:03,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:23:03,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:23:03,567 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:03,570 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:03,570 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:23:03,570 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:23:03,594 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:23:03,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:23:03,595 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:03,599 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:03,600 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:23:03,600 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:23:03,673 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:23:03,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:23:03,674 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:03,681 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:03,684 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:23:03,684 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:23:03,930 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:23:03,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:23:03,936 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:03,944 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:03,946 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:23:03,946 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:11 [2021-06-05 08:23:04,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 08:23:04,023 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:04,038 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:04,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:23:04,042 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:04,056 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:04,057 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:23:04,057 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:44 [2021-06-05 08:23:04,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:23:04,179 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:04,182 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:04,183 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:23:04,183 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2021-06-05 08:23:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 08:23:04,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024625104] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:23:04,185 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:23:04,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 20 [2021-06-05 08:23:04,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154050156] [2021-06-05 08:23:04,186 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 08:23:04,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:23:04,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 08:23:04,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2021-06-05 08:23:04,186 INFO L87 Difference]: Start difference. First operand 62411 states and 188678 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:04,947 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-06-05 08:23:05,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:23:05,729 INFO L93 Difference]: Finished difference Result 72957 states and 217434 transitions. [2021-06-05 08:23:05,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 08:23:05,730 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-06-05 08:23:05,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:23:05,843 INFO L225 Difference]: With dead ends: 72957 [2021-06-05 08:23:05,843 INFO L226 Difference]: Without dead ends: 71569 [2021-06-05 08:23:05,844 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 1052.2ms TimeCoverageRelationStatistics Valid=300, Invalid=1106, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 08:23:06,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71569 states. [2021-06-05 08:23:06,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71569 to 43593. [2021-06-05 08:23:06,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43593 states, 43589 states have (on average 2.971277157080915) internal successors, (129515), 43592 states have internal predecessors, (129515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43593 states to 43593 states and 129515 transitions. [2021-06-05 08:23:06,822 INFO L78 Accepts]: Start accepts. Automaton has 43593 states and 129515 transitions. Word has length 81 [2021-06-05 08:23:06,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:23:06,823 INFO L482 AbstractCegarLoop]: Abstraction has 43593 states and 129515 transitions. [2021-06-05 08:23:06,823 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:06,823 INFO L276 IsEmpty]: Start isEmpty. Operand 43593 states and 129515 transitions. [2021-06-05 08:23:06,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 08:23:06,841 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:23:06,841 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:23:07,054 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:23:07,057 INFO L430 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:23:07,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:23:07,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1728284555, now seen corresponding path program 3 times [2021-06-05 08:23:07,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:23:07,057 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824995724] [2021-06-05 08:23:07,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:23:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:23:07,278 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:23:07,278 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:23:07,278 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824995724] [2021-06-05 08:23:07,278 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824995724] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:23:07,278 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760593697] [2021-06-05 08:23:07,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:23:07,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:23:07,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:23:07,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 08:23:07,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:23:07,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:23:07,353 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:07,354 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:07,354 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:23:07,354 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 08:23:07,378 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:23:07,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:23:07,380 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:07,383 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:07,384 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:23:07,384 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2021-06-05 08:23:07,469 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:23:07,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:23:07,471 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:07,474 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:07,476 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:23:07,476 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2021-06-05 08:23:07,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:23:07,580 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:07,584 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:07,585 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:23:07,585 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:7 [2021-06-05 08:23:07,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:23:07,633 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:07,634 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:07,635 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:23:07,635 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2021-06-05 08:23:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-06-05 08:23:07,651 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760593697] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:23:07,651 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:23:07,651 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16] total 24 [2021-06-05 08:23:07,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109320165] [2021-06-05 08:23:07,651 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 08:23:07,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:23:07,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 08:23:07,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:23:07,652 INFO L87 Difference]: Start difference. First operand 43593 states and 129515 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:08,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:23:08,303 INFO L93 Difference]: Finished difference Result 47089 states and 138686 transitions. [2021-06-05 08:23:08,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 08:23:08,303 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 08:23:08,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:23:08,369 INFO L225 Difference]: With dead ends: 47089 [2021-06-05 08:23:08,369 INFO L226 Difference]: Without dead ends: 46705 [2021-06-05 08:23:08,369 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 416.8ms TimeCoverageRelationStatistics Valid=162, Invalid=1098, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 08:23:08,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46705 states. [2021-06-05 08:23:09,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46705 to 42915. [2021-06-05 08:23:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42915 states, 42911 states have (on average 2.9696814336650275) internal successors, (127432), 42914 states have internal predecessors, (127432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42915 states to 42915 states and 127432 transitions. [2021-06-05 08:23:09,209 INFO L78 Accepts]: Start accepts. Automaton has 42915 states and 127432 transitions. Word has length 82 [2021-06-05 08:23:09,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:23:09,210 INFO L482 AbstractCegarLoop]: Abstraction has 42915 states and 127432 transitions. [2021-06-05 08:23:09,210 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:09,210 INFO L276 IsEmpty]: Start isEmpty. Operand 42915 states and 127432 transitions. [2021-06-05 08:23:09,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 08:23:09,231 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:23:09,231 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:23:09,449 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2021-06-05 08:23:09,450 INFO L430 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:23:09,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:23:09,450 INFO L82 PathProgramCache]: Analyzing trace with hash -680198906, now seen corresponding path program 2 times [2021-06-05 08:23:09,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:23:09,450 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291811116] [2021-06-05 08:23:09,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:23:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:23:09,584 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-06-05 08:23:09,584 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:23:09,599 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291811116] [2021-06-05 08:23:09,599 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291811116] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:23:09,599 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915355649] [2021-06-05 08:23:09,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:23:09,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:23:09,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:23:09,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 38 conjunts are in the unsatisfiable core [2021-06-05 08:23:09,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:23:09,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:23:09,694 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:09,696 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:09,697 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:23:09,697 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:23:09,723 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:23:09,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:23:09,725 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:09,729 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:09,730 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:23:09,731 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:23:09,803 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:23:09,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:23:09,805 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:09,813 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:09,815 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:23:09,815 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:31 [2021-06-05 08:23:09,990 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:23:09,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:23:09,992 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:10,001 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:10,002 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:23:10,002 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:19 [2021-06-05 08:23:10,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:23:10,066 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:10,087 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:10,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 08:23:10,093 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:10,114 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:10,116 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:23:10,116 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:60 [2021-06-05 08:23:10,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:23:10,173 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:10,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-06-05 08:23:10,178 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:10,202 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:10,205 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:23:10,205 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:44 [2021-06-05 08:23:10,386 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2021-06-05 08:23:10,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:23:10,478 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:10,482 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:10,483 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:23:10,483 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2021-06-05 08:23:10,501 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-06-05 08:23:10,501 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915355649] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:23:10,501 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:23:10,501 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-06-05 08:23:10,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671815170] [2021-06-05 08:23:10,502 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-05 08:23:10,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:23:10,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-05 08:23:10,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2021-06-05 08:23:10,502 INFO L87 Difference]: Start difference. First operand 42915 states and 127432 transitions. Second operand has 20 states, 20 states have (on average 6.35) internal successors, (127), 20 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:23:13,635 INFO L93 Difference]: Finished difference Result 68589 states and 200614 transitions. [2021-06-05 08:23:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-06-05 08:23:13,635 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.35) internal successors, (127), 20 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-05 08:23:13,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:23:13,731 INFO L225 Difference]: With dead ends: 68589 [2021-06-05 08:23:13,732 INFO L226 Difference]: Without dead ends: 67791 [2021-06-05 08:23:13,732 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 2135.0ms TimeCoverageRelationStatistics Valid=728, Invalid=4528, Unknown=0, NotChecked=0, Total=5256 [2021-06-05 08:23:13,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67791 states. [2021-06-05 08:23:14,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67791 to 54385. [2021-06-05 08:23:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54385 states, 54381 states have (on average 2.9816296132840514) internal successors, (162144), 54384 states have internal predecessors, (162144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:15,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54385 states to 54385 states and 162144 transitions. [2021-06-05 08:23:15,034 INFO L78 Accepts]: Start accepts. Automaton has 54385 states and 162144 transitions. Word has length 86 [2021-06-05 08:23:15,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:23:15,034 INFO L482 AbstractCegarLoop]: Abstraction has 54385 states and 162144 transitions. [2021-06-05 08:23:15,034 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 6.35) internal successors, (127), 20 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:15,035 INFO L276 IsEmpty]: Start isEmpty. Operand 54385 states and 162144 transitions. [2021-06-05 08:23:15,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-05 08:23:15,058 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:23:15,058 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:23:15,272 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:23:15,273 INFO L430 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:23:15,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:23:15,273 INFO L82 PathProgramCache]: Analyzing trace with hash -949937654, now seen corresponding path program 2 times [2021-06-05 08:23:15,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:23:15,273 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504504774] [2021-06-05 08:23:15,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:23:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:23:15,418 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-06-05 08:23:15,418 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:23:15,418 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504504774] [2021-06-05 08:23:15,418 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504504774] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:23:15,418 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60050981] [2021-06-05 08:23:15,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:23:15,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:23:15,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:23:15,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 38 conjunts are in the unsatisfiable core [2021-06-05 08:23:15,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:23:15,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:23:15,493 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:15,495 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:15,496 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:23:15,496 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:23:15,524 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:23:15,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:23:15,526 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:15,530 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:15,531 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:23:15,531 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:23:15,604 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:23:15,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:23:15,606 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:15,613 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:15,614 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:23:15,614 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:31 [2021-06-05 08:23:15,798 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:23:15,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:23:15,801 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:15,809 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:15,810 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:23:15,810 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:19 [2021-06-05 08:23:15,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:23:15,889 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:15,911 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:15,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 08:23:15,917 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:15,937 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:15,938 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:23:15,938 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:60 [2021-06-05 08:23:16,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2021-06-05 08:23:16,054 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:16,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2021-06-05 08:23:16,060 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:16,085 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:16,087 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:23:16,087 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:90, output treesize:48 [2021-06-05 08:23:16,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:23:16,179 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:16,182 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:16,182 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:23:16,183 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2021-06-05 08:23:16,185 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-06-05 08:23:16,186 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60050981] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:23:16,186 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:23:16,186 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2021-06-05 08:23:16,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815491519] [2021-06-05 08:23:16,186 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 08:23:16,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:23:16,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 08:23:16,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2021-06-05 08:23:16,187 INFO L87 Difference]: Start difference. First operand 54385 states and 162144 transitions. Second operand has 23 states, 23 states have (on average 5.956521739130435) internal successors, (137), 23 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:16,787 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2021-06-05 08:23:23,501 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2021-06-05 08:23:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:23:25,162 INFO L93 Difference]: Finished difference Result 88843 states and 261522 transitions. [2021-06-05 08:23:25,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2021-06-05 08:23:25,163 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.956521739130435) internal successors, (137), 23 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2021-06-05 08:23:25,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:23:25,279 INFO L225 Difference]: With dead ends: 88843 [2021-06-05 08:23:25,279 INFO L226 Difference]: Without dead ends: 83102 [2021-06-05 08:23:25,281 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7004 ImplicationChecksByTransitivity, 7142.8ms TimeCoverageRelationStatistics Valid=3408, Invalid=14682, Unknown=0, NotChecked=0, Total=18090 [2021-06-05 08:23:25,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83102 states. [2021-06-05 08:23:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83102 to 52616. [2021-06-05 08:23:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52616 states, 52614 states have (on average 2.983882616794009) internal successors, (156994), 52615 states have internal predecessors, (156994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52616 states to 52616 states and 156994 transitions. [2021-06-05 08:23:26,416 INFO L78 Accepts]: Start accepts. Automaton has 52616 states and 156994 transitions. Word has length 87 [2021-06-05 08:23:26,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:23:26,416 INFO L482 AbstractCegarLoop]: Abstraction has 52616 states and 156994 transitions. [2021-06-05 08:23:26,417 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 5.956521739130435) internal successors, (137), 23 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 52616 states and 156994 transitions. [2021-06-05 08:23:26,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:23:26,471 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:23:26,472 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:23:26,672 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:23:26,673 INFO L430 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:23:26,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:23:26,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1594385037, now seen corresponding path program 1 times [2021-06-05 08:23:26,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:23:26,673 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710756634] [2021-06-05 08:23:26,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:23:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:23:26,910 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2021-06-05 08:23:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 08:23:27,013 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:23:27,013 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710756634] [2021-06-05 08:23:27,014 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710756634] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:23:27,014 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950045800] [2021-06-05 08:23:27,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:23:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:23:27,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 08:23:27,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:23:27,336 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:23:27,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2021-06-05 08:23:27,337 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:27,344 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:27,354 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:23:27,354 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2021-06-05 08:23:27,465 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:27,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2021-06-05 08:23:27,468 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:23:27,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:23:27,471 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:27,487 INFO L628 ElimStorePlain]: treesize reduction 5, result has 83.3 percent of original size [2021-06-05 08:23:27,489 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:23:27,489 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:21 [2021-06-05 08:23:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-06-05 08:23:27,511 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950045800] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:23:27,511 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:23:27,511 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 22 [2021-06-05 08:23:27,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475728789] [2021-06-05 08:23:27,512 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 08:23:27,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:23:27,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 08:23:27,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2021-06-05 08:23:27,512 INFO L87 Difference]: Start difference. First operand 52616 states and 156994 transitions. Second operand has 12 states, 12 states have (on average 8.75) internal successors, (105), 12 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:23:34,847 INFO L93 Difference]: Finished difference Result 111083 states and 326916 transitions. [2021-06-05 08:23:34,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 08:23:34,848 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.75) internal successors, (105), 12 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:23:34,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:23:35,015 INFO L225 Difference]: With dead ends: 111083 [2021-06-05 08:23:35,015 INFO L226 Difference]: Without dead ends: 109727 [2021-06-05 08:23:35,015 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 1225.9ms TimeCoverageRelationStatistics Valid=591, Invalid=2379, Unknown=0, NotChecked=0, Total=2970 [2021-06-05 08:23:35,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109727 states. [2021-06-05 08:23:36,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109727 to 67993. [2021-06-05 08:23:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67993 states, 67991 states have (on average 3.0102366489682457) internal successors, (204669), 67992 states have internal predecessors, (204669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:36,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67993 states to 67993 states and 204669 transitions. [2021-06-05 08:23:36,722 INFO L78 Accepts]: Start accepts. Automaton has 67993 states and 204669 transitions. Word has length 119 [2021-06-05 08:23:36,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:23:36,722 INFO L482 AbstractCegarLoop]: Abstraction has 67993 states and 204669 transitions. [2021-06-05 08:23:36,723 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 8.75) internal successors, (105), 12 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:36,723 INFO L276 IsEmpty]: Start isEmpty. Operand 67993 states and 204669 transitions. [2021-06-05 08:23:36,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:23:36,808 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:23:36,808 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:23:37,009 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:23:37,009 INFO L430 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:23:37,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:23:37,010 INFO L82 PathProgramCache]: Analyzing trace with hash -826030881, now seen corresponding path program 1 times [2021-06-05 08:23:37,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:23:37,011 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333624753] [2021-06-05 08:23:37,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:23:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:23:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-06-05 08:23:37,193 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:23:37,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333624753] [2021-06-05 08:23:37,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333624753] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:23:37,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443733701] [2021-06-05 08:23:37,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:23:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:23:37,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 08:23:37,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:23:37,740 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:23:37,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2021-06-05 08:23:37,741 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:37,749 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:37,753 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:23:37,754 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:29 [2021-06-05 08:23:37,797 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:37,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2021-06-05 08:23:37,800 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:23:37,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:23:37,802 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:37,817 INFO L628 ElimStorePlain]: treesize reduction 10, result has 66.7 percent of original size [2021-06-05 08:23:37,819 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:23:37,819 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:15 [2021-06-05 08:23:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-05 08:23:37,837 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443733701] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:23:37,837 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:23:37,838 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [14] total 26 [2021-06-05 08:23:37,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253561111] [2021-06-05 08:23:37,838 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:23:37,838 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:23:37,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:23:37,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:23:37,838 INFO L87 Difference]: Start difference. First operand 67993 states and 204669 transitions. Second operand has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:23:43,054 INFO L93 Difference]: Finished difference Result 86991 states and 259765 transitions. [2021-06-05 08:23:43,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-06-05 08:23:43,054 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:23:43,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:23:43,179 INFO L225 Difference]: With dead ends: 86991 [2021-06-05 08:23:43,180 INFO L226 Difference]: Without dead ends: 86445 [2021-06-05 08:23:43,180 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1066.2ms TimeCoverageRelationStatistics Valid=740, Invalid=2452, Unknown=0, NotChecked=0, Total=3192 [2021-06-05 08:23:43,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86445 states. [2021-06-05 08:23:44,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86445 to 72413. [2021-06-05 08:23:44,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72413 states, 72411 states have (on average 3.013381944732154) internal successors, (218202), 72412 states have internal predecessors, (218202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:44,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72413 states to 72413 states and 218202 transitions. [2021-06-05 08:23:44,646 INFO L78 Accepts]: Start accepts. Automaton has 72413 states and 218202 transitions. Word has length 119 [2021-06-05 08:23:44,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:23:44,646 INFO L482 AbstractCegarLoop]: Abstraction has 72413 states and 218202 transitions. [2021-06-05 08:23:44,646 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:23:44,646 INFO L276 IsEmpty]: Start isEmpty. Operand 72413 states and 218202 transitions. [2021-06-05 08:23:44,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:23:44,734 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:23:44,734 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:23:44,936 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2021-06-05 08:23:44,937 INFO L430 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:23:44,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:23:44,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1962512047, now seen corresponding path program 2 times [2021-06-05 08:23:44,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:23:44,937 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700090328] [2021-06-05 08:23:44,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:23:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:23:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-06-05 08:23:45,066 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:23:45,066 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700090328] [2021-06-05 08:23:45,066 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700090328] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:23:45,066 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289824378] [2021-06-05 08:23:45,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:23:45,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 08:23:45,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:23:45,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 36 conjunts are in the unsatisfiable core [2021-06-05 08:23:45,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:23:45,681 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2021-06-05 08:23:45,719 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:23:45,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2021-06-05 08:23:45,721 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:45,729 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:45,748 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:23:45,749 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:29 [2021-06-05 08:23:45,790 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:23:45,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2021-06-05 08:23:45,793 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:23:45,795 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:23:45,796 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:23:45,810 INFO L628 ElimStorePlain]: treesize reduction 10, result has 66.7 percent of original size [2021-06-05 08:23:45,811 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:23:45,811 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:15 [2021-06-05 08:23:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 08:23:45,829 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289824378] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:23:45,829 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:23:45,830 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2021-06-05 08:23:45,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41851096] [2021-06-05 08:23:45,830 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 08:23:45,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:23:45,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 08:23:45,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:23:45,830 INFO L87 Difference]: Start difference. First operand 72413 states and 218202 transitions. Second operand has 25 states, 25 states have (on average 6.32) internal successors, (158), 25 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:24:05,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:24:05,690 INFO L93 Difference]: Finished difference Result 142679 states and 421585 transitions. [2021-06-05 08:24:05,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2021-06-05 08:24:05,690 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.32) internal successors, (158), 25 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:24:05,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:24:05,912 INFO L225 Difference]: With dead ends: 142679 [2021-06-05 08:24:05,912 INFO L226 Difference]: Without dead ends: 140551 [2021-06-05 08:24:05,914 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9687 ImplicationChecksByTransitivity, 5323.9ms TimeCoverageRelationStatistics Valid=3911, Invalid=23479, Unknown=0, NotChecked=0, Total=27390 [2021-06-05 08:24:06,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140551 states. [2021-06-05 08:24:07,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140551 to 82945. [2021-06-05 08:24:07,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82945 states, 82943 states have (on average 3.0265724654280652) internal successors, (251033), 82944 states have internal predecessors, (251033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:24:07,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82945 states to 82945 states and 251033 transitions. [2021-06-05 08:24:07,983 INFO L78 Accepts]: Start accepts. Automaton has 82945 states and 251033 transitions. Word has length 119 [2021-06-05 08:24:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:24:07,983 INFO L482 AbstractCegarLoop]: Abstraction has 82945 states and 251033 transitions. [2021-06-05 08:24:07,983 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 6.32) internal successors, (158), 25 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:24:07,983 INFO L276 IsEmpty]: Start isEmpty. Operand 82945 states and 251033 transitions. [2021-06-05 08:24:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:24:08,083 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:24:08,083 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:24:08,283 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2021-06-05 08:24:08,284 INFO L430 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:24:08,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:24:08,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1789895543, now seen corresponding path program 3 times [2021-06-05 08:24:08,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:24:08,284 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388941427] [2021-06-05 08:24:08,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:24:08,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:24:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-05 08:24:08,413 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:24:08,413 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388941427] [2021-06-05 08:24:08,413 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388941427] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:24:08,413 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862059859] [2021-06-05 08:24:08,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:24:08,489 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 08:24:08,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:24:08,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 08:24:08,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:24:08,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:24:08,507 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:08,510 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:08,510 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:24:08,511 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:24:08,535 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:24:08,535 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:24:08,537 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:08,542 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:08,550 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:24:08,551 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:24:08,639 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:24:08,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:24:08,640 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:08,648 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:08,651 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:24:08,651 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:24:09,053 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-06-05 08:24:09,290 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:24:09,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:24:09,292 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:09,299 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:09,300 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:24:09,300 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:8 [2021-06-05 08:24:09,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-06-05 08:24:09,561 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:09,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 21 [2021-06-05 08:24:09,575 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:09,587 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:09,591 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 08:24:09,591 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:45 [2021-06-05 08:24:10,013 WARN L205 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-05 08:24:10,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:24:10,037 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:10,045 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:10,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:24:10,048 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:10,054 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:10,055 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:24:10,056 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:53, output treesize:7 [2021-06-05 08:24:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-06-05 08:24:10,071 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862059859] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:24:10,071 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:24:10,071 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 25 [2021-06-05 08:24:10,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519038057] [2021-06-05 08:24:10,071 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:24:10,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:24:10,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:24:10,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:24:10,072 INFO L87 Difference]: Start difference. First operand 82945 states and 251033 transitions. Second operand has 14 states, 14 states have (on average 7.357142857142857) internal successors, (103), 14 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:24:11,605 WARN L205 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2021-06-05 08:24:12,682 WARN L205 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-06-05 08:24:13,613 WARN L205 SmtUtils]: Spent 852.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-06-05 08:24:14,565 WARN L205 SmtUtils]: Spent 894.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2021-06-05 08:24:15,486 WARN L205 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2021-06-05 08:24:16,371 WARN L205 SmtUtils]: Spent 843.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2021-06-05 08:24:17,255 WARN L205 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-06-05 08:24:18,188 WARN L205 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2021-06-05 08:24:19,025 WARN L205 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2021-06-05 08:24:19,896 WARN L205 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2021-06-05 08:24:20,817 WARN L205 SmtUtils]: Spent 898.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2021-06-05 08:24:21,692 WARN L205 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2021-06-05 08:24:22,603 WARN L205 SmtUtils]: Spent 838.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2021-06-05 08:24:23,534 WARN L205 SmtUtils]: Spent 898.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2021-06-05 08:24:25,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:24:25,621 INFO L93 Difference]: Finished difference Result 90771 states and 273210 transitions. [2021-06-05 08:24:25,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 08:24:25,622 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.357142857142857) internal successors, (103), 14 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:24:25,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:24:25,752 INFO L225 Difference]: With dead ends: 90771 [2021-06-05 08:24:25,753 INFO L226 Difference]: Without dead ends: 90425 [2021-06-05 08:24:25,753 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 15447.5ms TimeCoverageRelationStatistics Valid=553, Invalid=2416, Unknown=1, NotChecked=0, Total=2970 [2021-06-05 08:24:25,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90425 states. [2021-06-05 08:24:27,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90425 to 86617. [2021-06-05 08:24:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86617 states, 86615 states have (on average 3.0247763089534145) internal successors, (261991), 86616 states have internal predecessors, (261991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:24:27,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86617 states to 86617 states and 261991 transitions. [2021-06-05 08:24:27,398 INFO L78 Accepts]: Start accepts. Automaton has 86617 states and 261991 transitions. Word has length 119 [2021-06-05 08:24:27,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:24:27,398 INFO L482 AbstractCegarLoop]: Abstraction has 86617 states and 261991 transitions. [2021-06-05 08:24:27,398 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 7.357142857142857) internal successors, (103), 14 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:24:27,398 INFO L276 IsEmpty]: Start isEmpty. Operand 86617 states and 261991 transitions. [2021-06-05 08:24:27,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:24:27,499 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:24:27,499 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:24:27,700 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:24:27,700 INFO L430 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:24:27,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:24:27,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2103007905, now seen corresponding path program 4 times [2021-06-05 08:24:27,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:24:27,701 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379399422] [2021-06-05 08:24:27,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:24:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:24:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-05 08:24:27,829 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:24:27,829 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379399422] [2021-06-05 08:24:27,829 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379399422] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:24:27,829 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812515942] [2021-06-05 08:24:27,829 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:24:27,900 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:24:27,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:24:27,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 08:24:27,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:24:28,237 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:24:28,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2021-06-05 08:24:28,239 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:28,246 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:28,251 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:24:28,251 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:29 [2021-06-05 08:24:28,536 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:28,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2021-06-05 08:24:28,539 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:24:28,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:24:28,542 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:28,565 INFO L628 ElimStorePlain]: treesize reduction 10, result has 66.7 percent of original size [2021-06-05 08:24:28,566 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:24:28,566 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:15 [2021-06-05 08:24:28,577 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-06-05 08:24:28,577 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812515942] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:24:28,577 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:24:28,577 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2021-06-05 08:24:28,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643906043] [2021-06-05 08:24:28,578 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 08:24:28,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:24:28,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 08:24:28,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:24:28,583 INFO L87 Difference]: Start difference. First operand 86617 states and 261991 transitions. Second operand has 24 states, 24 states have (on average 6.625) internal successors, (159), 24 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:24:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:24:35,757 INFO L93 Difference]: Finished difference Result 181149 states and 537178 transitions. [2021-06-05 08:24:35,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2021-06-05 08:24:35,758 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 6.625) internal successors, (159), 24 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:24:35,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:24:36,049 INFO L225 Difference]: With dead ends: 181149 [2021-06-05 08:24:36,049 INFO L226 Difference]: Without dead ends: 177681 [2021-06-05 08:24:36,051 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10265 ImplicationChecksByTransitivity, 4831.1ms TimeCoverageRelationStatistics Valid=4259, Invalid=24471, Unknown=0, NotChecked=0, Total=28730 [2021-06-05 08:24:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177681 states. [2021-06-05 08:24:38,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177681 to 94250. [2021-06-05 08:24:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94250 states, 94248 states have (on average 3.0249766573295984) internal successors, (285098), 94249 states have internal predecessors, (285098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:24:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94250 states to 94250 states and 285098 transitions. [2021-06-05 08:24:38,641 INFO L78 Accepts]: Start accepts. Automaton has 94250 states and 285098 transitions. Word has length 119 [2021-06-05 08:24:38,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:24:38,641 INFO L482 AbstractCegarLoop]: Abstraction has 94250 states and 285098 transitions. [2021-06-05 08:24:38,641 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 6.625) internal successors, (159), 24 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:24:38,642 INFO L276 IsEmpty]: Start isEmpty. Operand 94250 states and 285098 transitions. [2021-06-05 08:24:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:24:38,757 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:24:38,758 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:24:38,972 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable106 [2021-06-05 08:24:38,975 INFO L430 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:24:38,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:24:38,975 INFO L82 PathProgramCache]: Analyzing trace with hash 278559033, now seen corresponding path program 5 times [2021-06-05 08:24:38,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:24:38,975 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151508091] [2021-06-05 08:24:38,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:24:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:24:39,084 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-05 08:24:39,084 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:24:39,084 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151508091] [2021-06-05 08:24:39,084 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151508091] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:24:39,085 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758205033] [2021-06-05 08:24:39,085 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:24:39,175 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-06-05 08:24:39,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:24:39,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 38 conjunts are in the unsatisfiable core [2021-06-05 08:24:39,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:24:39,480 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:24:39,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2021-06-05 08:24:39,482 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:39,489 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:39,493 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:24:39,493 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:29 [2021-06-05 08:24:39,536 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:39,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2021-06-05 08:24:39,538 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:24:39,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:24:39,541 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:39,555 INFO L628 ElimStorePlain]: treesize reduction 10, result has 66.7 percent of original size [2021-06-05 08:24:39,556 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:24:39,556 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:15 [2021-06-05 08:24:39,574 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 08:24:39,575 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758205033] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:24:39,575 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:24:39,575 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13] total 25 [2021-06-05 08:24:39,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143448521] [2021-06-05 08:24:39,575 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:24:39,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:24:39,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:24:39,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:24:39,576 INFO L87 Difference]: Start difference. First operand 94250 states and 285098 transitions. Second operand has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:24:43,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:24:43,525 INFO L93 Difference]: Finished difference Result 187252 states and 562851 transitions. [2021-06-05 08:24:43,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-06-05 08:24:43,525 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:24:43,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:24:43,819 INFO L225 Difference]: With dead ends: 187252 [2021-06-05 08:24:43,820 INFO L226 Difference]: Without dead ends: 186588 [2021-06-05 08:24:43,820 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 814.9ms TimeCoverageRelationStatistics Valid=585, Invalid=2607, Unknown=0, NotChecked=0, Total=3192 [2021-06-05 08:24:44,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186588 states. [2021-06-05 08:24:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186588 to 103476. [2021-06-05 08:24:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103476 states, 103474 states have (on average 3.038057869609757) internal successors, (314360), 103475 states have internal predecessors, (314360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:24:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103476 states to 103476 states and 314360 transitions. [2021-06-05 08:24:46,886 INFO L78 Accepts]: Start accepts. Automaton has 103476 states and 314360 transitions. Word has length 119 [2021-06-05 08:24:46,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:24:46,886 INFO L482 AbstractCegarLoop]: Abstraction has 103476 states and 314360 transitions. [2021-06-05 08:24:46,886 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:24:46,887 INFO L276 IsEmpty]: Start isEmpty. Operand 103476 states and 314360 transitions. [2021-06-05 08:24:47,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:24:47,018 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:24:47,018 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:24:47,233 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2021-06-05 08:24:47,234 INFO L430 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:24:47,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:24:47,235 INFO L82 PathProgramCache]: Analyzing trace with hash 2721841, now seen corresponding path program 6 times [2021-06-05 08:24:47,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:24:47,235 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264320566] [2021-06-05 08:24:47,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:24:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:24:47,402 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-05 08:24:47,402 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:24:47,402 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264320566] [2021-06-05 08:24:47,402 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264320566] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:24:47,402 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97175480] [2021-06-05 08:24:47,402 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:24:47,540 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 08:24:47,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:24:47,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 43 conjunts are in the unsatisfiable core [2021-06-05 08:24:47,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:24:47,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:24:47,587 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:47,591 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:47,591 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:24:47,592 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-06-05 08:24:47,635 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:24:47,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2021-06-05 08:24:47,638 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:47,645 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:47,646 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:24:47,646 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2021-06-05 08:24:47,694 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:24:47,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2021-06-05 08:24:47,697 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:47,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:24:47,701 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:47,719 INFO L628 ElimStorePlain]: treesize reduction 8, result has 84.0 percent of original size [2021-06-05 08:24:47,721 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 08:24:47,721 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 [2021-06-05 08:24:47,849 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:24:47,850 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:24:47,851 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:47,856 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:24:47,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:24:47,858 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:47,868 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:47,869 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:24:47,869 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:28 [2021-06-05 08:24:48,511 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:24:48,512 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:24:48,516 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:48,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 21 [2021-06-05 08:24:48,524 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:48,542 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:48,550 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:24:48,550 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:104, output treesize:50 [2021-06-05 08:24:48,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:24:48,623 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:48,638 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:48,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:24:48,643 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:48,648 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:24:48,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 08:24:48,650 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 08:24:48,661 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:24:48,663 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-06-05 08:24:48,663 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:74, output treesize:22 [2021-06-05 08:24:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-06-05 08:24:48,684 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97175480] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:24:48,684 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:24:48,684 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 26 [2021-06-05 08:24:48,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232778234] [2021-06-05 08:24:48,684 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 08:24:48,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:24:48,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 08:24:48,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:24:48,685 INFO L87 Difference]: Start difference. First operand 103476 states and 314360 transitions. Second operand has 26 states, 26 states have (on average 7.769230769230769) internal successors, (202), 26 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:24:57,252 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2021-06-05 08:25:02,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:25:02,620 INFO L93 Difference]: Finished difference Result 275515 states and 822608 transitions. [2021-06-05 08:25:02,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2021-06-05 08:25:02,620 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.769230769230769) internal successors, (202), 26 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:25:02,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:25:03,180 INFO L225 Difference]: With dead ends: 275515 [2021-06-05 08:25:03,180 INFO L226 Difference]: Without dead ends: 273465 [2021-06-05 08:25:03,182 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12830 ImplicationChecksByTransitivity, 7136.2ms TimeCoverageRelationStatistics Valid=3600, Invalid=29342, Unknown=0, NotChecked=0, Total=32942 [2021-06-05 08:25:03,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273465 states. [2021-06-05 08:25:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273465 to 130473. [2021-06-05 08:25:07,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130473 states, 130471 states have (on average 3.042269929716182) internal successors, (396928), 130472 states have internal predecessors, (396928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:07,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130473 states to 130473 states and 396928 transitions. [2021-06-05 08:25:07,378 INFO L78 Accepts]: Start accepts. Automaton has 130473 states and 396928 transitions. Word has length 119 [2021-06-05 08:25:07,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:25:07,379 INFO L482 AbstractCegarLoop]: Abstraction has 130473 states and 396928 transitions. [2021-06-05 08:25:07,379 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 7.769230769230769) internal successors, (202), 26 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:07,379 INFO L276 IsEmpty]: Start isEmpty. Operand 130473 states and 396928 transitions. [2021-06-05 08:25:08,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:25:08,037 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:25:08,037 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:25:08,244 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:25:08,245 INFO L430 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:25:08,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:25:08,245 INFO L82 PathProgramCache]: Analyzing trace with hash -116694485, now seen corresponding path program 7 times [2021-06-05 08:25:08,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:25:08,245 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343337434] [2021-06-05 08:25:08,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:25:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:25:08,357 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-06-05 08:25:08,357 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:25:08,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343337434] [2021-06-05 08:25:08,357 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343337434] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:25:08,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893241481] [2021-06-05 08:25:08,357 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:25:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:25:08,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 08:25:08,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:25:08,767 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:25:08,767 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2021-06-05 08:25:08,769 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:08,776 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:08,780 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:25:08,781 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:29 [2021-06-05 08:25:08,839 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:08,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2021-06-05 08:25:08,842 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:25:08,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:25:08,844 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:08,859 INFO L628 ElimStorePlain]: treesize reduction 10, result has 66.7 percent of original size [2021-06-05 08:25:08,860 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:25:08,860 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:15 [2021-06-05 08:25:08,870 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-05 08:25:08,871 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893241481] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:25:08,871 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:25:08,871 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13] total 24 [2021-06-05 08:25:08,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448536684] [2021-06-05 08:25:08,871 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:25:08,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:25:08,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:25:08,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:25:08,872 INFO L87 Difference]: Start difference. First operand 130473 states and 396928 transitions. Second operand has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:19,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:25:19,729 INFO L93 Difference]: Finished difference Result 212452 states and 642123 transitions. [2021-06-05 08:25:19,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-05 08:25:19,730 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:25:19,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:25:20,143 INFO L225 Difference]: With dead ends: 212452 [2021-06-05 08:25:20,144 INFO L226 Difference]: Without dead ends: 211590 [2021-06-05 08:25:20,144 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2338 ImplicationChecksByTransitivity, 1728.2ms TimeCoverageRelationStatistics Valid=1544, Invalid=6646, Unknown=0, NotChecked=0, Total=8190 [2021-06-05 08:25:20,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211590 states. [2021-06-05 08:25:22,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211590 to 133535. [2021-06-05 08:25:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133535 states, 133533 states have (on average 3.0438618169291485) internal successors, (406456), 133534 states have internal predecessors, (406456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133535 states to 133535 states and 406456 transitions. [2021-06-05 08:25:23,736 INFO L78 Accepts]: Start accepts. Automaton has 133535 states and 406456 transitions. Word has length 119 [2021-06-05 08:25:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:25:23,736 INFO L482 AbstractCegarLoop]: Abstraction has 133535 states and 406456 transitions. [2021-06-05 08:25:23,736 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 133535 states and 406456 transitions. [2021-06-05 08:25:23,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:25:23,935 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:25:23,935 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:25:24,135 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:25:24,135 INFO L430 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:25:24,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:25:24,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2071974173, now seen corresponding path program 8 times [2021-06-05 08:25:24,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:25:24,136 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313848345] [2021-06-05 08:25:24,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:25:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:25:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-06-05 08:25:24,245 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:25:24,246 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313848345] [2021-06-05 08:25:24,246 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313848345] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:25:24,246 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089879343] [2021-06-05 08:25:24,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:25:24,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:25:24,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:25:24,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 08:25:24,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:25:24,602 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:25:24,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 25 [2021-06-05 08:25:24,604 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:24,612 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:24,616 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:25:24,616 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:27 [2021-06-05 08:25:24,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:25:24,655 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:24,659 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:25:24,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 08:25:24,661 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:24,668 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:24,669 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:25:24,669 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:19 [2021-06-05 08:25:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-06-05 08:25:24,697 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089879343] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:25:24,697 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:25:24,697 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 23 [2021-06-05 08:25:24,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808684666] [2021-06-05 08:25:24,698 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 08:25:24,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:25:24,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 08:25:24,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2021-06-05 08:25:24,698 INFO L87 Difference]: Start difference. First operand 133535 states and 406456 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:27,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:25:27,116 INFO L93 Difference]: Finished difference Result 144976 states and 438563 transitions. [2021-06-05 08:25:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 08:25:27,117 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:25:27,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:25:27,390 INFO L225 Difference]: With dead ends: 144976 [2021-06-05 08:25:27,390 INFO L226 Difference]: Without dead ends: 144714 [2021-06-05 08:25:27,390 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 518.1ms TimeCoverageRelationStatistics Valid=254, Invalid=1386, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 08:25:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144714 states. [2021-06-05 08:25:30,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144714 to 134361. [2021-06-05 08:25:30,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134361 states, 134359 states have (on average 3.045482624907896) internal successors, (409188), 134360 states have internal predecessors, (409188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134361 states to 134361 states and 409188 transitions. [2021-06-05 08:25:30,498 INFO L78 Accepts]: Start accepts. Automaton has 134361 states and 409188 transitions. Word has length 119 [2021-06-05 08:25:30,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:25:30,499 INFO L482 AbstractCegarLoop]: Abstraction has 134361 states and 409188 transitions. [2021-06-05 08:25:30,499 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 134361 states and 409188 transitions. [2021-06-05 08:25:30,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:25:30,680 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:25:30,680 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:25:30,887 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:25:30,887 INFO L430 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:25:30,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:25:30,887 INFO L82 PathProgramCache]: Analyzing trace with hash -271108223, now seen corresponding path program 9 times [2021-06-05 08:25:30,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:25:30,888 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775961525] [2021-06-05 08:25:30,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:25:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:25:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-06-05 08:25:31,013 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:25:31,013 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775961525] [2021-06-05 08:25:31,013 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775961525] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:25:31,013 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664729004] [2021-06-05 08:25:31,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:25:31,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:25:31,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:25:31,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 08:25:31,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:25:31,856 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:25:31,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 25 [2021-06-05 08:25:31,857 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:31,865 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:31,870 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:25:31,870 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:27 [2021-06-05 08:25:31,947 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:31,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:25:31,949 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:25:31,961 INFO L628 ElimStorePlain]: treesize reduction 4, result has 81.8 percent of original size [2021-06-05 08:25:31,963 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:25:31,963 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2021-06-05 08:25:31,983 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-06-05 08:25:31,984 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664729004] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:25:31,984 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:25:31,984 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 23 [2021-06-05 08:25:31,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036254300] [2021-06-05 08:25:31,984 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 08:25:31,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:25:31,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 08:25:31,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-06-05 08:25:31,984 INFO L87 Difference]: Start difference. First operand 134361 states and 409188 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:25:34,715 INFO L93 Difference]: Finished difference Result 145474 states and 439876 transitions. [2021-06-05 08:25:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-05 08:25:34,716 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:25:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:25:34,932 INFO L225 Difference]: With dead ends: 145474 [2021-06-05 08:25:34,933 INFO L226 Difference]: Without dead ends: 145142 [2021-06-05 08:25:34,933 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 965.0ms TimeCoverageRelationStatistics Valid=315, Invalid=1665, Unknown=0, NotChecked=0, Total=1980 [2021-06-05 08:25:35,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145142 states. [2021-06-05 08:25:37,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145142 to 134345. [2021-06-05 08:25:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134345 states, 134343 states have (on average 3.0455029290696203) internal successors, (409142), 134344 states have internal predecessors, (409142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:38,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134345 states to 134345 states and 409142 transitions. [2021-06-05 08:25:38,098 INFO L78 Accepts]: Start accepts. Automaton has 134345 states and 409142 transitions. Word has length 119 [2021-06-05 08:25:38,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:25:38,098 INFO L482 AbstractCegarLoop]: Abstraction has 134345 states and 409142 transitions. [2021-06-05 08:25:38,099 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand 134345 states and 409142 transitions. [2021-06-05 08:25:38,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:25:38,282 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:25:38,282 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:25:38,482 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable155 [2021-06-05 08:25:38,483 INFO L430 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:25:38,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:25:38,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2017112057, now seen corresponding path program 10 times [2021-06-05 08:25:38,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:25:38,483 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610847663] [2021-06-05 08:25:38,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:25:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:25:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-06-05 08:25:38,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:25:38,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610847663] [2021-06-05 08:25:38,583 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610847663] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:25:38,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958140087] [2021-06-05 08:25:38,583 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:25:38,683 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:25:38,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:25:38,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 08:25:38,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:25:38,913 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:25:38,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2021-06-05 08:25:38,914 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:38,921 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:38,925 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:25:38,925 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2021-06-05 08:25:39,033 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:39,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2021-06-05 08:25:39,035 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:25:39,037 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:25:39,038 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:39,052 INFO L628 ElimStorePlain]: treesize reduction 10, result has 66.7 percent of original size [2021-06-05 08:25:39,053 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:25:39,053 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:15 [2021-06-05 08:25:39,069 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-05 08:25:39,070 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958140087] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:25:39,070 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:25:39,070 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 22 [2021-06-05 08:25:39,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414861298] [2021-06-05 08:25:39,071 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 08:25:39,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:25:39,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 08:25:39,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-06-05 08:25:39,071 INFO L87 Difference]: Start difference. First operand 134345 states and 409142 transitions. Second operand has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:47,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:25:47,787 INFO L93 Difference]: Finished difference Result 225698 states and 681553 transitions. [2021-06-05 08:25:47,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-06-05 08:25:47,787 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:25:47,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:25:48,195 INFO L225 Difference]: With dead ends: 225698 [2021-06-05 08:25:48,195 INFO L226 Difference]: Without dead ends: 224976 [2021-06-05 08:25:48,195 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 875.6ms TimeCoverageRelationStatistics Valid=714, Invalid=2592, Unknown=0, NotChecked=0, Total=3306 [2021-06-05 08:25:48,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224976 states. [2021-06-05 08:25:51,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224976 to 133874. [2021-06-05 08:25:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133874 states, 133872 states have (on average 3.044258694872714) internal successors, (407541), 133873 states have internal predecessors, (407541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133874 states to 133874 states and 407541 transitions. [2021-06-05 08:25:51,786 INFO L78 Accepts]: Start accepts. Automaton has 133874 states and 407541 transitions. Word has length 119 [2021-06-05 08:25:51,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:25:51,786 INFO L482 AbstractCegarLoop]: Abstraction has 133874 states and 407541 transitions. [2021-06-05 08:25:51,786 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:51,786 INFO L276 IsEmpty]: Start isEmpty. Operand 133874 states and 407541 transitions. [2021-06-05 08:25:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:25:51,969 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:25:51,969 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:25:52,169 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:25:52,170 INFO L430 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:25:52,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:25:52,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1608667567, now seen corresponding path program 11 times [2021-06-05 08:25:52,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:25:52,170 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922501614] [2021-06-05 08:25:52,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:25:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:25:52,279 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-06-05 08:25:52,280 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:25:52,280 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922501614] [2021-06-05 08:25:52,280 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922501614] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:25:52,280 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358995205] [2021-06-05 08:25:52,280 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:25:52,357 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-06-05 08:25:52,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:25:52,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 08:25:52,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:25:53,151 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:25:53,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2021-06-05 08:25:53,152 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:53,161 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:53,166 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:25:53,166 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:29 [2021-06-05 08:25:53,218 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:25:53,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2021-06-05 08:25:53,226 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:25:53,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:25:53,230 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:25:53,248 INFO L628 ElimStorePlain]: treesize reduction 10, result has 66.7 percent of original size [2021-06-05 08:25:53,249 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:25:53,250 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:15 [2021-06-05 08:25:53,262 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-05 08:25:53,263 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358995205] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:25:53,263 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:25:53,263 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13] total 24 [2021-06-05 08:25:53,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932147630] [2021-06-05 08:25:53,263 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:25:53,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:25:53,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:25:53,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:25:53,264 INFO L87 Difference]: Start difference. First operand 133874 states and 407541 transitions. Second operand has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:25:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:25:57,888 INFO L93 Difference]: Finished difference Result 154441 states and 465797 transitions. [2021-06-05 08:25:57,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 08:25:57,888 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:25:57,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:25:58,128 INFO L225 Difference]: With dead ends: 154441 [2021-06-05 08:25:58,129 INFO L226 Difference]: Without dead ends: 153937 [2021-06-05 08:25:58,129 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1162.7ms TimeCoverageRelationStatistics Valid=480, Invalid=1970, Unknown=0, NotChecked=0, Total=2450 [2021-06-05 08:25:58,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153937 states. [2021-06-05 08:26:00,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153937 to 134860. [2021-06-05 08:26:00,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134860 states, 134858 states have (on average 3.043682985065773) internal successors, (410465), 134859 states have internal predecessors, (410465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134860 states to 134860 states and 410465 transitions. [2021-06-05 08:26:00,991 INFO L78 Accepts]: Start accepts. Automaton has 134860 states and 410465 transitions. Word has length 119 [2021-06-05 08:26:00,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:26:00,991 INFO L482 AbstractCegarLoop]: Abstraction has 134860 states and 410465 transitions. [2021-06-05 08:26:00,991 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:00,991 INFO L276 IsEmpty]: Start isEmpty. Operand 134860 states and 410465 transitions. [2021-06-05 08:26:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:26:01,600 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:26:01,600 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:26:01,832 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174,28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:26:01,832 INFO L430 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:26:01,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:26:01,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1461088687, now seen corresponding path program 12 times [2021-06-05 08:26:01,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:26:01,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450240967] [2021-06-05 08:26:01,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:26:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:26:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-06-05 08:26:01,940 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:26:01,940 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450240967] [2021-06-05 08:26:01,941 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450240967] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:26:01,941 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783873070] [2021-06-05 08:26:01,941 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:26:02,032 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 08:26:02,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:26:02,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 38 conjunts are in the unsatisfiable core [2021-06-05 08:26:02,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:26:02,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:26:02,053 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:02,056 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:02,056 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:26:02,056 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:26:02,090 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-06-05 08:26:02,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-06-05 08:26:02,091 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:02,096 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:02,097 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:26:02,097 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2021-06-05 08:26:02,127 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:26:02,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:26:02,129 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:02,132 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:02,133 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:26:02,133 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2021-06-05 08:26:02,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:26:02,160 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:02,165 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:02,166 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:26:02,166 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 08:26:02,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:26:02,184 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:02,189 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:02,190 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:26:02,190 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2021-06-05 08:26:02,426 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:26:02,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 27 [2021-06-05 08:26:02,429 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:02,437 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:02,441 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:26:02,441 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:29 [2021-06-05 08:26:02,483 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:02,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2021-06-05 08:26:02,486 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:26:02,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:26:02,490 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:02,504 INFO L628 ElimStorePlain]: treesize reduction 10, result has 66.7 percent of original size [2021-06-05 08:26:02,505 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:26:02,505 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:15 [2021-06-05 08:26:02,524 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-06-05 08:26:02,524 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783873070] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:26:02,524 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:26:02,524 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2021-06-05 08:26:02,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560887490] [2021-06-05 08:26:02,525 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 08:26:02,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:26:02,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 08:26:02,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:26:02,525 INFO L87 Difference]: Start difference. First operand 134860 states and 410465 transitions. Second operand has 24 states, 24 states have (on average 8.041666666666666) internal successors, (193), 24 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:10,201 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2021-06-05 08:26:17,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:26:17,848 INFO L93 Difference]: Finished difference Result 208319 states and 618896 transitions. [2021-06-05 08:26:17,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2021-06-05 08:26:17,849 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.041666666666666) internal successors, (193), 24 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:26:17,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:26:18,223 INFO L225 Difference]: With dead ends: 208319 [2021-06-05 08:26:18,223 INFO L226 Difference]: Without dead ends: 199443 [2021-06-05 08:26:18,225 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10777 ImplicationChecksByTransitivity, 4872.1ms TimeCoverageRelationStatistics Valid=4189, Invalid=23867, Unknown=0, NotChecked=0, Total=28056 [2021-06-05 08:26:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199443 states. [2021-06-05 08:26:21,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199443 to 138196. [2021-06-05 08:26:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138196 states, 138194 states have (on average 3.0548287190471366) internal successors, (422159), 138195 states have internal predecessors, (422159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:22,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138196 states to 138196 states and 422159 transitions. [2021-06-05 08:26:22,121 INFO L78 Accepts]: Start accepts. Automaton has 138196 states and 422159 transitions. Word has length 119 [2021-06-05 08:26:22,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:26:22,121 INFO L482 AbstractCegarLoop]: Abstraction has 138196 states and 422159 transitions. [2021-06-05 08:26:22,121 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 8.041666666666666) internal successors, (193), 24 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:22,121 INFO L276 IsEmpty]: Start isEmpty. Operand 138196 states and 422159 transitions. [2021-06-05 08:26:22,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:26:22,325 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:26:22,325 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:26:22,526 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:26:22,526 INFO L430 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:26:22,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:26:22,527 INFO L82 PathProgramCache]: Analyzing trace with hash -706724987, now seen corresponding path program 2 times [2021-06-05 08:26:22,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:26:22,527 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970113467] [2021-06-05 08:26:22,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:26:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:26:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 08:26:22,674 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:26:22,674 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970113467] [2021-06-05 08:26:22,674 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970113467] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:26:22,674 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320977643] [2021-06-05 08:26:22,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:26:22,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:26:22,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:26:22,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 40 conjunts are in the unsatisfiable core [2021-06-05 08:26:22,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:26:22,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:26:22,772 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:22,774 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:22,775 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:26:22,775 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:26:22,801 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:26:22,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:26:22,802 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:22,807 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:22,808 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:26:22,808 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:26:22,877 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:26:22,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:26:22,879 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:22,887 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:22,890 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:26:22,890 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:26:23,227 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:26:23,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:26:23,230 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:23,237 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:23,239 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:26:23,239 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:8 [2021-06-05 08:26:23,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 21 [2021-06-05 08:26:23,392 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:23,399 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:23,401 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:26:23,401 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:22 [2021-06-05 08:26:23,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:26:23,497 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:23,500 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:23,500 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:26:23,500 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-06-05 08:26:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-06-05 08:26:23,516 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320977643] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:26:23,516 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:26:23,516 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 25 [2021-06-05 08:26:23,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109976917] [2021-06-05 08:26:23,516 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:26:23,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:26:23,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:26:23,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:26:23,517 INFO L87 Difference]: Start difference. First operand 138196 states and 422159 transitions. Second operand has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:26,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:26:26,226 INFO L93 Difference]: Finished difference Result 146732 states and 445924 transitions. [2021-06-05 08:26:26,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-06-05 08:26:26,227 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:26:26,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:26:26,666 INFO L225 Difference]: With dead ends: 146732 [2021-06-05 08:26:26,667 INFO L226 Difference]: Without dead ends: 146330 [2021-06-05 08:26:26,667 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1571 ImplicationChecksByTransitivity, 1387.2ms TimeCoverageRelationStatistics Valid=897, Invalid=4653, Unknown=0, NotChecked=0, Total=5550 [2021-06-05 08:26:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146330 states. [2021-06-05 08:26:28,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146330 to 139748. [2021-06-05 08:26:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139748 states, 139746 states have (on average 3.054756486768852) internal successors, (426890), 139747 states have internal predecessors, (426890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139748 states to 139748 states and 426890 transitions. [2021-06-05 08:26:29,512 INFO L78 Accepts]: Start accepts. Automaton has 139748 states and 426890 transitions. Word has length 119 [2021-06-05 08:26:29,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:26:29,513 INFO L482 AbstractCegarLoop]: Abstraction has 139748 states and 426890 transitions. [2021-06-05 08:26:29,513 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:29,513 INFO L276 IsEmpty]: Start isEmpty. Operand 139748 states and 426890 transitions. [2021-06-05 08:26:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:26:30,269 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:26:30,269 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:26:30,484 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable190 [2021-06-05 08:26:30,484 INFO L430 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:26:30,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:26:30,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1709938829, now seen corresponding path program 3 times [2021-06-05 08:26:30,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:26:30,485 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185670163] [2021-06-05 08:26:30,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:26:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:26:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 08:26:30,594 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:26:30,594 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185670163] [2021-06-05 08:26:30,594 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185670163] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:26:30,594 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290277012] [2021-06-05 08:26:30,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:26:30,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:26:30,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:26:30,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 40 conjunts are in the unsatisfiable core [2021-06-05 08:26:30,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:26:30,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:26:30,718 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:30,721 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:30,721 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:26:30,721 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:26:30,745 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:26:30,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:26:30,747 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:30,751 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:30,752 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:26:30,752 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 08:26:30,835 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:26:30,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:26:30,836 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:30,844 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:30,846 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:26:30,847 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 08:26:31,251 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:26:31,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:26:31,253 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:31,260 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:31,261 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:26:31,261 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:8 [2021-06-05 08:26:31,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 21 [2021-06-05 08:26:31,449 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:31,455 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:31,459 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:26:31,459 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:22 [2021-06-05 08:26:31,521 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:26:31,522 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:31,525 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:31,525 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:26:31,526 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2021-06-05 08:26:31,541 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-06-05 08:26:31,541 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290277012] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:26:31,541 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:26:31,541 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 25 [2021-06-05 08:26:31,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136174143] [2021-06-05 08:26:31,541 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:26:31,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:26:31,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:26:31,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:26:31,542 INFO L87 Difference]: Start difference. First operand 139748 states and 426890 transitions. Second operand has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:37,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:26:37,081 INFO L93 Difference]: Finished difference Result 147350 states and 447640 transitions. [2021-06-05 08:26:37,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-06-05 08:26:37,081 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:26:37,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:26:37,343 INFO L225 Difference]: With dead ends: 147350 [2021-06-05 08:26:37,343 INFO L226 Difference]: Without dead ends: 146992 [2021-06-05 08:26:37,344 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 4433.7ms TimeCoverageRelationStatistics Valid=690, Invalid=3214, Unknown=2, NotChecked=0, Total=3906 [2021-06-05 08:26:37,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146992 states. [2021-06-05 08:26:40,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146992 to 139892. [2021-06-05 08:26:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139892 states, 139890 states have (on average 3.054771606262063) internal successors, (427332), 139891 states have internal predecessors, (427332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139892 states to 139892 states and 427332 transitions. [2021-06-05 08:26:40,650 INFO L78 Accepts]: Start accepts. Automaton has 139892 states and 427332 transitions. Word has length 119 [2021-06-05 08:26:40,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:26:40,651 INFO L482 AbstractCegarLoop]: Abstraction has 139892 states and 427332 transitions. [2021-06-05 08:26:40,651 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:40,651 INFO L276 IsEmpty]: Start isEmpty. Operand 139892 states and 427332 transitions. [2021-06-05 08:26:40,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:26:40,842 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:26:40,843 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:26:41,058 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:26:41,060 INFO L430 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:26:41,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:26:41,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1116630077, now seen corresponding path program 4 times [2021-06-05 08:26:41,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:26:41,061 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840790491] [2021-06-05 08:26:41,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:26:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:26:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 08:26:41,191 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:26:41,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840790491] [2021-06-05 08:26:41,192 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840790491] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:26:41,192 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817583383] [2021-06-05 08:26:41,192 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:26:41,261 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:26:41,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:26:41,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 08:26:41,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:26:41,583 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:26:41,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2021-06-05 08:26:41,585 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:41,592 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:41,598 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:26:41,598 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:29 [2021-06-05 08:26:41,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:26:41,640 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:41,644 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:26:41,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 08:26:41,646 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:26:41,653 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:26:41,654 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:26:41,654 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:21 [2021-06-05 08:26:41,665 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-06-05 08:26:41,665 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817583383] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:26:41,666 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:26:41,666 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2021-06-05 08:26:41,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228715942] [2021-06-05 08:26:41,666 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 08:26:41,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:26:41,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 08:26:41,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:26:41,666 INFO L87 Difference]: Start difference. First operand 139892 states and 427332 transitions. Second operand has 24 states, 24 states have (on average 6.458333333333333) internal successors, (155), 24 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:51,979 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2021-06-05 08:26:54,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:26:54,698 INFO L93 Difference]: Finished difference Result 268350 states and 806018 transitions. [2021-06-05 08:26:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2021-06-05 08:26:54,698 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 6.458333333333333) internal successors, (155), 24 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:26:54,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:26:55,236 INFO L225 Difference]: With dead ends: 268350 [2021-06-05 08:26:55,236 INFO L226 Difference]: Without dead ends: 265876 [2021-06-05 08:26:55,237 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5977 ImplicationChecksByTransitivity, 3282.6ms TimeCoverageRelationStatistics Valid=3083, Invalid=14739, Unknown=0, NotChecked=0, Total=17822 [2021-06-05 08:26:56,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265876 states. [2021-06-05 08:26:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265876 to 153358. [2021-06-05 08:26:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153358 states, 153356 states have (on average 3.0533529826025716) internal successors, (468250), 153357 states have internal predecessors, (468250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153358 states to 153358 states and 468250 transitions. [2021-06-05 08:26:59,919 INFO L78 Accepts]: Start accepts. Automaton has 153358 states and 468250 transitions. Word has length 119 [2021-06-05 08:26:59,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:26:59,919 INFO L482 AbstractCegarLoop]: Abstraction has 153358 states and 468250 transitions. [2021-06-05 08:26:59,919 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 6.458333333333333) internal successors, (155), 24 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:26:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 153358 states and 468250 transitions. [2021-06-05 08:27:00,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:27:00,135 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:27:00,135 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:27:00,336 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192,32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:27:00,336 INFO L430 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:27:00,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:27:00,337 INFO L82 PathProgramCache]: Analyzing trace with hash -939038313, now seen corresponding path program 5 times [2021-06-05 08:27:00,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:27:00,337 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177151649] [2021-06-05 08:27:00,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:27:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:27:00,453 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-06-05 08:27:00,453 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:27:00,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177151649] [2021-06-05 08:27:00,453 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177151649] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:27:00,453 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074118935] [2021-06-05 08:27:00,453 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:27:00,529 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 08:27:00,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:27:00,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 08:27:00,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:27:00,843 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:27:00,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2021-06-05 08:27:00,844 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:00,851 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:00,857 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:27:00,858 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:29 [2021-06-05 08:27:00,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:27:00,898 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:00,903 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:27:00,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 08:27:00,904 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:00,912 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:00,913 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:27:00,913 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:21 [2021-06-05 08:27:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-05 08:27:00,925 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074118935] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:27:00,925 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:27:00,925 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13] total 24 [2021-06-05 08:27:00,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163615726] [2021-06-05 08:27:00,925 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:27:00,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:27:00,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:27:00,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:27:00,925 INFO L87 Difference]: Start difference. First operand 153358 states and 468250 transitions. Second operand has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:27:11,142 INFO L93 Difference]: Finished difference Result 288764 states and 872888 transitions. [2021-06-05 08:27:11,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-06-05 08:27:11,142 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:27:11,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:27:11,917 INFO L225 Difference]: With dead ends: 288764 [2021-06-05 08:27:11,917 INFO L226 Difference]: Without dead ends: 287364 [2021-06-05 08:27:11,918 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2249 ImplicationChecksByTransitivity, 1753.0ms TimeCoverageRelationStatistics Valid=1635, Invalid=6555, Unknown=0, NotChecked=0, Total=8190 [2021-06-05 08:27:12,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287364 states. [2021-06-05 08:27:15,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287364 to 167180. [2021-06-05 08:27:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167180 states, 167178 states have (on average 3.0594097309454593) internal successors, (511466), 167179 states have internal predecessors, (511466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167180 states to 167180 states and 511466 transitions. [2021-06-05 08:27:16,198 INFO L78 Accepts]: Start accepts. Automaton has 167180 states and 511466 transitions. Word has length 119 [2021-06-05 08:27:16,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:27:16,198 INFO L482 AbstractCegarLoop]: Abstraction has 167180 states and 511466 transitions. [2021-06-05 08:27:16,198 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 6.8) internal successors, (102), 15 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:16,198 INFO L276 IsEmpty]: Start isEmpty. Operand 167180 states and 511466 transitions. [2021-06-05 08:27:16,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:27:16,905 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:27:16,906 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:27:17,127 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable200 [2021-06-05 08:27:17,127 INFO L430 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:27:17,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:27:17,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1076185667, now seen corresponding path program 6 times [2021-06-05 08:27:17,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:27:17,128 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559220551] [2021-06-05 08:27:17,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:27:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:27:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-06-05 08:27:17,246 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:27:17,246 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559220551] [2021-06-05 08:27:17,246 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559220551] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:27:17,246 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125512657] [2021-06-05 08:27:17,246 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:27:17,330 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 08:27:17,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:27:17,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 08:27:17,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:27:17,628 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:27:17,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 25 [2021-06-05 08:27:17,629 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:17,637 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:17,645 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:27:17,646 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:27 [2021-06-05 08:27:17,686 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:17,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:27:17,688 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:27:17,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:27:17,690 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:17,708 INFO L628 ElimStorePlain]: treesize reduction 9, result has 71.9 percent of original size [2021-06-05 08:27:17,709 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:27:17,709 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:19 [2021-06-05 08:27:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-06-05 08:27:17,731 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125512657] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:27:17,731 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:27:17,731 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 23 [2021-06-05 08:27:17,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135529827] [2021-06-05 08:27:17,732 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 08:27:17,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:27:17,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 08:27:17,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2021-06-05 08:27:17,732 INFO L87 Difference]: Start difference. First operand 167180 states and 511466 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:20,676 WARN L205 SmtUtils]: Spent 432.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-06-05 08:27:21,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:27:21,918 INFO L93 Difference]: Finished difference Result 171600 states and 523113 transitions. [2021-06-05 08:27:21,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 08:27:21,918 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:27:21,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:27:22,200 INFO L225 Difference]: With dead ends: 171600 [2021-06-05 08:27:22,200 INFO L226 Difference]: Without dead ends: 171322 [2021-06-05 08:27:22,200 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 931.2ms TimeCoverageRelationStatistics Valid=237, Invalid=1323, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 08:27:22,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171322 states. [2021-06-05 08:27:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171322 to 167372. [2021-06-05 08:27:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167372 states, 167370 states have (on average 3.0593296289657643) internal successors, (512040), 167371 states have internal predecessors, (512040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:25,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167372 states to 167372 states and 512040 transitions. [2021-06-05 08:27:25,970 INFO L78 Accepts]: Start accepts. Automaton has 167372 states and 512040 transitions. Word has length 119 [2021-06-05 08:27:25,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:27:25,971 INFO L482 AbstractCegarLoop]: Abstraction has 167372 states and 512040 transitions. [2021-06-05 08:27:25,971 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:25,971 INFO L276 IsEmpty]: Start isEmpty. Operand 167372 states and 512040 transitions. [2021-06-05 08:27:26,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:27:26,216 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:27:26,216 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:27:26,432 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:27:26,432 INFO L430 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:27:26,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:27:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash -395422175, now seen corresponding path program 7 times [2021-06-05 08:27:26,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:27:26,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805634030] [2021-06-05 08:27:26,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:27:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:27:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-06-05 08:27:26,562 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:27:26,562 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805634030] [2021-06-05 08:27:26,563 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805634030] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:27:26,563 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106759441] [2021-06-05 08:27:26,563 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:27:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:27:26,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 08:27:26,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:27:26,889 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:27:26,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2021-06-05 08:27:26,890 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:26,897 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:26,906 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:27:26,906 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2021-06-05 08:27:26,941 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:26,942 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2021-06-05 08:27:26,944 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:27:26,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:27:26,947 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:26,963 INFO L628 ElimStorePlain]: treesize reduction 5, result has 83.3 percent of original size [2021-06-05 08:27:26,964 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:27:26,964 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:21 [2021-06-05 08:27:26,985 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-05 08:27:26,985 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106759441] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:27:26,985 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:27:26,985 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 22 [2021-06-05 08:27:26,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194203776] [2021-06-05 08:27:26,985 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 08:27:26,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:27:26,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 08:27:26,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2021-06-05 08:27:26,986 INFO L87 Difference]: Start difference. First operand 167372 states and 512040 transitions. Second operand has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:32,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:27:32,445 INFO L93 Difference]: Finished difference Result 257382 states and 780869 transitions. [2021-06-05 08:27:32,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-06-05 08:27:32,445 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:27:32,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:27:33,296 INFO L225 Difference]: With dead ends: 257382 [2021-06-05 08:27:33,296 INFO L226 Difference]: Without dead ends: 256572 [2021-06-05 08:27:33,296 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 787.6ms TimeCoverageRelationStatistics Valid=714, Invalid=2592, Unknown=0, NotChecked=0, Total=3306 [2021-06-05 08:27:33,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256572 states. [2021-06-05 08:27:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256572 to 167756. [2021-06-05 08:27:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167756 states, 167754 states have (on average 3.060219130393314) internal successors, (513364), 167755 states have internal predecessors, (513364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167756 states to 167756 states and 513364 transitions. [2021-06-05 08:27:37,773 INFO L78 Accepts]: Start accepts. Automaton has 167756 states and 513364 transitions. Word has length 119 [2021-06-05 08:27:37,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:27:37,773 INFO L482 AbstractCegarLoop]: Abstraction has 167756 states and 513364 transitions. [2021-06-05 08:27:37,773 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand 167756 states and 513364 transitions. [2021-06-05 08:27:38,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:27:38,003 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:27:38,003 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:27:38,203 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable217 [2021-06-05 08:27:38,204 INFO L430 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:27:38,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:27:38,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2083328423, now seen corresponding path program 8 times [2021-06-05 08:27:38,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:27:38,204 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313226627] [2021-06-05 08:27:38,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:27:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:27:38,320 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-06-05 08:27:38,320 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:27:38,321 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313226627] [2021-06-05 08:27:38,321 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313226627] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:27:38,321 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448778795] [2021-06-05 08:27:38,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:27:38,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:27:38,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:27:38,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 08:27:38,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:27:38,675 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:27:38,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 25 [2021-06-05 08:27:38,677 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:38,685 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:38,691 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:27:38,691 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:27 [2021-06-05 08:27:38,735 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:38,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:27:38,738 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:27:38,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:27:38,741 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:38,759 INFO L628 ElimStorePlain]: treesize reduction 9, result has 71.9 percent of original size [2021-06-05 08:27:38,761 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:27:38,761 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:19 [2021-06-05 08:27:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-06-05 08:27:39,272 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448778795] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:27:39,272 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:27:39,272 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 23 [2021-06-05 08:27:39,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971406556] [2021-06-05 08:27:39,272 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 08:27:39,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:27:39,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 08:27:39,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-06-05 08:27:39,273 INFO L87 Difference]: Start difference. First operand 167756 states and 513364 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:42,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:27:42,254 INFO L93 Difference]: Finished difference Result 171434 states and 523034 transitions. [2021-06-05 08:27:42,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 08:27:42,255 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:27:42,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:27:42,533 INFO L225 Difference]: With dead ends: 171434 [2021-06-05 08:27:42,533 INFO L226 Difference]: Without dead ends: 171156 [2021-06-05 08:27:42,533 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 995.2ms TimeCoverageRelationStatistics Valid=238, Invalid=1322, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 08:27:43,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171156 states. [2021-06-05 08:27:45,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171156 to 167564. [2021-06-05 08:27:45,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167564 states, 167562 states have (on average 3.0602881321540685) internal successors, (512788), 167563 states have internal predecessors, (512788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:46,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167564 states to 167564 states and 512788 transitions. [2021-06-05 08:27:46,181 INFO L78 Accepts]: Start accepts. Automaton has 167564 states and 512788 transitions. Word has length 119 [2021-06-05 08:27:46,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:27:46,181 INFO L482 AbstractCegarLoop]: Abstraction has 167564 states and 512788 transitions. [2021-06-05 08:27:46,181 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:46,181 INFO L276 IsEmpty]: Start isEmpty. Operand 167564 states and 512788 transitions. [2021-06-05 08:27:46,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:27:46,413 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:27:46,413 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:27:46,614 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable226,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:27:46,614 INFO L430 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:27:46,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:27:46,614 INFO L82 PathProgramCache]: Analyzing trace with hash 901100303, now seen corresponding path program 9 times [2021-06-05 08:27:46,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:27:46,614 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325227423] [2021-06-05 08:27:46,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:27:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:27:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-06-05 08:27:46,725 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:27:46,725 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325227423] [2021-06-05 08:27:46,725 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325227423] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:27:46,725 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136499270] [2021-06-05 08:27:46,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:27:46,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:27:46,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:27:46,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 34 conjunts are in the unsatisfiable core [2021-06-05 08:27:46,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:27:47,564 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:27:47,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 25 [2021-06-05 08:27:47,565 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:47,572 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:47,577 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:27:47,578 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:27 [2021-06-05 08:27:47,690 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:47,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:27:47,692 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:27:47,704 INFO L628 ElimStorePlain]: treesize reduction 4, result has 81.8 percent of original size [2021-06-05 08:27:47,705 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:27:47,705 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2021-06-05 08:27:47,725 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-06-05 08:27:47,725 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136499270] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:27:47,725 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:27:47,726 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 23 [2021-06-05 08:27:47,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018054434] [2021-06-05 08:27:47,726 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 08:27:47,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:27:47,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 08:27:47,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2021-06-05 08:27:47,726 INFO L87 Difference]: Start difference. First operand 167564 states and 512788 transitions. Second operand has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:51,387 WARN L205 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2021-06-05 08:27:52,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:27:52,241 INFO L93 Difference]: Finished difference Result 172610 states and 526344 transitions. [2021-06-05 08:27:52,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-05 08:27:52,241 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:27:52,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:27:52,510 INFO L225 Difference]: With dead ends: 172610 [2021-06-05 08:27:52,510 INFO L226 Difference]: Without dead ends: 172208 [2021-06-05 08:27:52,510 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 1595.1ms TimeCoverageRelationStatistics Valid=393, Invalid=2363, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 08:27:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172208 states. [2021-06-05 08:27:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172208 to 167588. [2021-06-05 08:27:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167588 states, 167586 states have (on average 3.060249662859666) internal successors, (512855), 167587 states have internal predecessors, (512855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:56,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167588 states to 167588 states and 512855 transitions. [2021-06-05 08:27:56,355 INFO L78 Accepts]: Start accepts. Automaton has 167588 states and 512855 transitions. Word has length 119 [2021-06-05 08:27:56,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:27:56,356 INFO L482 AbstractCegarLoop]: Abstraction has 167588 states and 512855 transitions. [2021-06-05 08:27:56,356 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 7.538461538461538) internal successors, (98), 13 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:27:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 167588 states and 512855 transitions. [2021-06-05 08:27:56,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:27:56,980 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:27:56,980 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:27:57,196 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable235 [2021-06-05 08:27:57,196 INFO L430 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:27:57,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:27:57,196 INFO L82 PathProgramCache]: Analyzing trace with hash -977203177, now seen corresponding path program 10 times [2021-06-05 08:27:57,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:27:57,196 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812822690] [2021-06-05 08:27:57,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:27:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:27:57,366 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-06-05 08:27:57,366 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:27:57,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812822690] [2021-06-05 08:27:57,366 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812822690] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:27:57,366 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357178383] [2021-06-05 08:27:57,366 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:27:57,467 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:27:57,467 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:27:57,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 08:27:57,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:27:57,735 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:27:57,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2021-06-05 08:27:57,736 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:57,744 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:57,750 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:27:57,750 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2021-06-05 08:27:57,817 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:27:57,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2021-06-05 08:27:57,819 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:27:57,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:27:57,822 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:27:57,840 INFO L628 ElimStorePlain]: treesize reduction 5, result has 83.3 percent of original size [2021-06-05 08:27:57,841 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:27:57,841 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:21 [2021-06-05 08:27:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-05 08:27:57,870 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357178383] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:27:57,870 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:27:57,870 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 22 [2021-06-05 08:27:57,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146695664] [2021-06-05 08:27:57,870 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 08:27:57,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:27:57,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 08:27:57,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2021-06-05 08:27:57,885 INFO L87 Difference]: Start difference. First operand 167588 states and 512855 transitions. Second operand has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:02,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:02,398 INFO L93 Difference]: Finished difference Result 252634 states and 768013 transitions. [2021-06-05 08:28:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-06-05 08:28:02,398 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:28:02,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:02,866 INFO L225 Difference]: With dead ends: 252634 [2021-06-05 08:28:02,866 INFO L226 Difference]: Without dead ends: 251808 [2021-06-05 08:28:02,867 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 840.9ms TimeCoverageRelationStatistics Valid=657, Invalid=2423, Unknown=0, NotChecked=0, Total=3080 [2021-06-05 08:28:03,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251808 states. [2021-06-05 08:28:06,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251808 to 167180. [2021-06-05 08:28:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167180 states, 167178 states have (on average 3.0593618777590352) internal successors, (511458), 167179 states have internal predecessors, (511458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167180 states to 167180 states and 511458 transitions. [2021-06-05 08:28:07,461 INFO L78 Accepts]: Start accepts. Automaton has 167180 states and 511458 transitions. Word has length 119 [2021-06-05 08:28:07,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:07,462 INFO L482 AbstractCegarLoop]: Abstraction has 167180 states and 511458 transitions. [2021-06-05 08:28:07,462 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 8.5) internal successors, (102), 12 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 167180 states and 511458 transitions. [2021-06-05 08:28:07,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:28:07,763 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:07,763 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:07,963 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable245 [2021-06-05 08:28:07,964 INFO L430 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:07,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:07,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1654181153, now seen corresponding path program 11 times [2021-06-05 08:28:07,965 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:07,965 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24148343] [2021-06-05 08:28:07,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 08:28:08,087 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:08,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24148343] [2021-06-05 08:28:08,087 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24148343] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:28:08,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103841885] [2021-06-05 08:28:08,087 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:28:08,160 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 08:28:08,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:28:08,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 08:28:08,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:28:08,481 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:28:08,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2021-06-05 08:28:08,483 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:08,490 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:08,496 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:28:08,496 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:29 [2021-06-05 08:28:08,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:28:08,540 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:08,545 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:28:08,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 08:28:08,546 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:08,553 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:08,554 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:28:08,554 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:21 [2021-06-05 08:28:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 08:28:08,565 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103841885] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:28:08,565 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:28:08,565 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2021-06-05 08:28:08,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494846006] [2021-06-05 08:28:08,566 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 08:28:08,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:08,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 08:28:08,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:28:08,566 INFO L87 Difference]: Start difference. First operand 167180 states and 511458 transitions. Second operand has 24 states, 24 states have (on average 6.416666666666667) internal successors, (154), 24 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:13,794 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2021-06-05 08:28:15,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:15,339 INFO L93 Difference]: Finished difference Result 246508 states and 743364 transitions. [2021-06-05 08:28:15,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2021-06-05 08:28:15,339 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 6.416666666666667) internal successors, (154), 24 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:28:15,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:15,803 INFO L225 Difference]: With dead ends: 246508 [2021-06-05 08:28:15,803 INFO L226 Difference]: Without dead ends: 244698 [2021-06-05 08:28:15,804 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2973 ImplicationChecksByTransitivity, 2346.0ms TimeCoverageRelationStatistics Valid=1750, Invalid=7756, Unknown=0, NotChecked=0, Total=9506 [2021-06-05 08:28:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244698 states. [2021-06-05 08:28:19,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244698 to 172100. [2021-06-05 08:28:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172100 states, 172098 states have (on average 3.059280177573243) internal successors, (526496), 172099 states have internal predecessors, (526496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172100 states to 172100 states and 526496 transitions. [2021-06-05 08:28:20,147 INFO L78 Accepts]: Start accepts. Automaton has 172100 states and 526496 transitions. Word has length 119 [2021-06-05 08:28:20,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:20,147 INFO L482 AbstractCegarLoop]: Abstraction has 172100 states and 526496 transitions. [2021-06-05 08:28:20,148 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 6.416666666666667) internal successors, (154), 24 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:20,148 INFO L276 IsEmpty]: Start isEmpty. Operand 172100 states and 526496 transitions. [2021-06-05 08:28:20,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:28:20,888 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:20,889 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:21,105 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable255 [2021-06-05 08:28:21,105 INFO L430 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:21,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:21,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1100741499, now seen corresponding path program 12 times [2021-06-05 08:28:21,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:21,106 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426252840] [2021-06-05 08:28:21,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 08:28:21,228 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:21,228 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426252840] [2021-06-05 08:28:21,228 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426252840] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:28:21,228 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946443631] [2021-06-05 08:28:21,228 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:28:21,287 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 08:28:21,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:28:21,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 36 conjunts are in the unsatisfiable core [2021-06-05 08:28:21,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:28:21,527 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:28:21,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 25 [2021-06-05 08:28:21,528 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:21,535 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:21,539 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:28:21,540 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:27 [2021-06-05 08:28:21,576 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:21,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:28:21,578 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:28:21,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:28:21,581 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:21,597 INFO L628 ElimStorePlain]: treesize reduction 9, result has 71.9 percent of original size [2021-06-05 08:28:21,598 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:28:21,598 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:19 [2021-06-05 08:28:21,618 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-06-05 08:28:21,619 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946443631] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:28:21,619 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:28:21,619 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 23 [2021-06-05 08:28:21,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759767102] [2021-06-05 08:28:21,619 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 08:28:21,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:21,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 08:28:21,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2021-06-05 08:28:21,620 INFO L87 Difference]: Start difference. First operand 172100 states and 526496 transitions. Second operand has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 13 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:26,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:26,331 INFO L93 Difference]: Finished difference Result 196067 states and 594157 transitions. [2021-06-05 08:28:26,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 08:28:26,332 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 13 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:28:26,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:26,644 INFO L225 Difference]: With dead ends: 196067 [2021-06-05 08:28:26,644 INFO L226 Difference]: Without dead ends: 195789 [2021-06-05 08:28:26,644 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 486.2ms TimeCoverageRelationStatistics Valid=255, Invalid=1305, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 08:28:27,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195789 states. [2021-06-05 08:28:30,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195789 to 176854. [2021-06-05 08:28:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176854 states, 176852 states have (on average 3.0629509420306245) internal successors, (541689), 176853 states have internal predecessors, (541689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:30,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176854 states to 176854 states and 541689 transitions. [2021-06-05 08:28:30,687 INFO L78 Accepts]: Start accepts. Automaton has 176854 states and 541689 transitions. Word has length 119 [2021-06-05 08:28:30,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:30,688 INFO L482 AbstractCegarLoop]: Abstraction has 176854 states and 541689 transitions. [2021-06-05 08:28:30,688 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 7.769230769230769) internal successors, (101), 13 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:30,688 INFO L276 IsEmpty]: Start isEmpty. Operand 176854 states and 541689 transitions. [2021-06-05 08:28:30,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:28:30,917 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:30,917 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:31,118 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable263,40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:28:31,119 INFO L430 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:31,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:31,119 INFO L82 PathProgramCache]: Analyzing trace with hash -278978391, now seen corresponding path program 13 times [2021-06-05 08:28:31,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:31,119 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775809915] [2021-06-05 08:28:31,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-06-05 08:28:31,299 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:31,299 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775809915] [2021-06-05 08:28:31,299 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775809915] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:28:31,300 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479522476] [2021-06-05 08:28:31,300 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:28:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:31,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 33 conjunts are in the unsatisfiable core [2021-06-05 08:28:31,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:28:31,647 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:28:31,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2021-06-05 08:28:31,648 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:31,655 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:31,661 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:28:31,661 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:29 [2021-06-05 08:28:31,785 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:31,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2021-06-05 08:28:31,787 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:28:31,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:28:31,790 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:31,807 INFO L628 ElimStorePlain]: treesize reduction 5, result has 83.3 percent of original size [2021-06-05 08:28:31,809 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:28:31,809 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:21 [2021-06-05 08:28:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-06-05 08:28:31,833 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479522476] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:28:31,833 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:28:31,833 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2021-06-05 08:28:31,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125144243] [2021-06-05 08:28:31,833 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 08:28:31,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:31,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 08:28:31,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:28:31,834 INFO L87 Difference]: Start difference. First operand 176854 states and 541689 transitions. Second operand has 24 states, 24 states have (on average 8.291666666666666) internal successors, (199), 24 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:32,538 WARN L205 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2021-06-05 08:28:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:42,735 INFO L93 Difference]: Finished difference Result 255687 states and 766790 transitions. [2021-06-05 08:28:42,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2021-06-05 08:28:42,736 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 8.291666666666666) internal successors, (199), 24 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:28:42,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:43,215 INFO L225 Difference]: With dead ends: 255687 [2021-06-05 08:28:43,215 INFO L226 Difference]: Without dead ends: 253675 [2021-06-05 08:28:43,217 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 108 SyntacticMatches, 6 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10102 ImplicationChecksByTransitivity, 4326.6ms TimeCoverageRelationStatistics Valid=3408, Invalid=22032, Unknown=0, NotChecked=0, Total=25440 [2021-06-05 08:28:43,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253675 states. [2021-06-05 08:28:46,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253675 to 166378. [2021-06-05 08:28:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166378 states, 166376 states have (on average 3.056053757753522) internal successors, (508454), 166377 states have internal predecessors, (508454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:48,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166378 states to 166378 states and 508454 transitions. [2021-06-05 08:28:48,015 INFO L78 Accepts]: Start accepts. Automaton has 166378 states and 508454 transitions. Word has length 119 [2021-06-05 08:28:48,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:48,015 INFO L482 AbstractCegarLoop]: Abstraction has 166378 states and 508454 transitions. [2021-06-05 08:28:48,015 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 8.291666666666666) internal successors, (199), 24 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:48,015 INFO L276 IsEmpty]: Start isEmpty. Operand 166378 states and 508454 transitions. [2021-06-05 08:28:48,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:28:48,261 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:48,261 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:48,462 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:28:48,462 INFO L430 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:48,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:48,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1233128131, now seen corresponding path program 13 times [2021-06-05 08:28:48,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:48,463 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88476976] [2021-06-05 08:28:48,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-05 08:28:48,652 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:48,652 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88476976] [2021-06-05 08:28:48,652 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88476976] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:28:48,652 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538223333] [2021-06-05 08:28:48,652 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:28:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:48,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 08:28:48,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:28:49,060 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:28:49,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2021-06-05 08:28:49,061 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:49,071 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:28:49,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-06-05 08:28:49,074 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:49,104 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.3 percent of original size [2021-06-05 08:28:49,110 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:28:49,110 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:53 [2021-06-05 08:28:49,177 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:49,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:28:49,179 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:28:49,206 INFO L628 ElimStorePlain]: treesize reduction 24, result has 66.7 percent of original size [2021-06-05 08:28:49,212 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:28:49,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 08:28:49,217 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:49,229 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:49,240 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:28:49,241 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:77, output treesize:25 [2021-06-05 08:28:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-06-05 08:28:49,269 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538223333] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:28:49,270 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:28:49,270 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2021-06-05 08:28:49,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833718828] [2021-06-05 08:28:49,270 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 08:28:49,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:28:49,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 08:28:49,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2021-06-05 08:28:49,271 INFO L87 Difference]: Start difference. First operand 166378 states and 508454 transitions. Second operand has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:50,801 WARN L205 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2021-06-05 08:28:53,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:28:53,338 INFO L93 Difference]: Finished difference Result 266696 states and 809097 transitions. [2021-06-05 08:28:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 08:28:53,339 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:28:53,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:28:53,861 INFO L225 Difference]: With dead ends: 266696 [2021-06-05 08:28:53,861 INFO L226 Difference]: Without dead ends: 266076 [2021-06-05 08:28:53,861 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1335.1ms TimeCoverageRelationStatistics Valid=325, Invalid=1837, Unknown=0, NotChecked=0, Total=2162 [2021-06-05 08:28:54,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266076 states. [2021-06-05 08:28:58,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266076 to 174678. [2021-06-05 08:28:58,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174678 states, 174676 states have (on average 3.0595731525796332) internal successors, (534434), 174677 states have internal predecessors, (534434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174678 states to 174678 states and 534434 transitions. [2021-06-05 08:28:58,821 INFO L78 Accepts]: Start accepts. Automaton has 174678 states and 534434 transitions. Word has length 119 [2021-06-05 08:28:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:28:58,821 INFO L482 AbstractCegarLoop]: Abstraction has 174678 states and 534434 transitions. [2021-06-05 08:28:58,821 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:28:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 174678 states and 534434 transitions. [2021-06-05 08:28:59,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:28:59,071 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:28:59,071 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:28:59,272 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284,42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:28:59,272 INFO L430 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:28:59,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:28:59,273 INFO L82 PathProgramCache]: Analyzing trace with hash 567737819, now seen corresponding path program 14 times [2021-06-05 08:28:59,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:28:59,273 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144289082] [2021-06-05 08:28:59,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:28:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:28:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-05 08:28:59,471 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:28:59,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144289082] [2021-06-05 08:28:59,471 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144289082] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:28:59,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501038519] [2021-06-05 08:28:59,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:28:59,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:28:59,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:28:59,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 08:28:59,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:28:59,790 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:28:59,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 25 [2021-06-05 08:28:59,792 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:59,802 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:28:59,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-06-05 08:28:59,804 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:28:59,821 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:59,828 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:28:59,829 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:78, output treesize:55 [2021-06-05 08:28:59,964 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:59,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:28:59,966 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:28:59,992 INFO L628 ElimStorePlain]: treesize reduction 4, result has 92.0 percent of original size [2021-06-05 08:28:59,997 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:28:59,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:28:59,999 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 08:29:00,517 WARN L205 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2021-06-05 08:29:00,517 INFO L628 ElimStorePlain]: treesize reduction 9, result has 78.0 percent of original size [2021-06-05 08:29:00,519 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:29:00,519 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:55, output treesize:23 [2021-06-05 08:29:00,554 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-06-05 08:29:00,554 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501038519] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:29:00,554 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:29:00,554 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 25 [2021-06-05 08:29:00,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604106396] [2021-06-05 08:29:00,555 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:29:00,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:29:00,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:29:00,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:29:00,555 INFO L87 Difference]: Start difference. First operand 174678 states and 534434 transitions. Second operand has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:02,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:29:02,193 INFO L93 Difference]: Finished difference Result 187615 states and 570338 transitions. [2021-06-05 08:29:02,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 08:29:02,194 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:29:02,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:29:02,519 INFO L225 Difference]: With dead ends: 187615 [2021-06-05 08:29:02,519 INFO L226 Difference]: Without dead ends: 187289 [2021-06-05 08:29:02,519 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 948.5ms TimeCoverageRelationStatistics Valid=191, Invalid=1215, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 08:29:03,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187289 states. [2021-06-05 08:29:05,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187289 to 175022. [2021-06-05 08:29:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175022 states, 175020 states have (on average 3.0595417666552396) internal successors, (535481), 175021 states have internal predecessors, (535481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175022 states to 175022 states and 535481 transitions. [2021-06-05 08:29:06,206 INFO L78 Accepts]: Start accepts. Automaton has 175022 states and 535481 transitions. Word has length 119 [2021-06-05 08:29:06,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:29:06,206 INFO L482 AbstractCegarLoop]: Abstraction has 175022 states and 535481 transitions. [2021-06-05 08:29:06,206 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:06,206 INFO L276 IsEmpty]: Start isEmpty. Operand 175022 states and 535481 transitions. [2021-06-05 08:29:07,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:29:07,033 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:29:07,034 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:29:07,234 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable300 [2021-06-05 08:29:07,235 INFO L430 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:29:07,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:29:07,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1439009197, now seen corresponding path program 15 times [2021-06-05 08:29:07,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:29:07,235 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246441760] [2021-06-05 08:29:07,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:29:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:29:07,408 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-05 08:29:07,408 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:29:07,409 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246441760] [2021-06-05 08:29:07,409 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246441760] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:29:07,409 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537326565] [2021-06-05 08:29:07,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:29:07,489 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:29:07,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:29:07,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 08:29:07,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:29:07,731 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:29:07,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-06-05 08:29:07,734 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:07,745 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:29:07,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 25 [2021-06-05 08:29:07,747 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:07,763 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:07,773 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:29:07,773 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:78, output treesize:55 [2021-06-05 08:29:07,979 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:07,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:29:07,981 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:29:08,009 INFO L628 ElimStorePlain]: treesize reduction 4, result has 92.0 percent of original size [2021-06-05 08:29:08,014 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:08,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:29:08,023 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 08:29:08,050 INFO L628 ElimStorePlain]: treesize reduction 9, result has 78.0 percent of original size [2021-06-05 08:29:08,052 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:29:08,052 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:55, output treesize:23 [2021-06-05 08:29:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-06-05 08:29:08,078 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537326565] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:29:08,078 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:29:08,078 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 22 [2021-06-05 08:29:08,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473502661] [2021-06-05 08:29:08,079 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:29:08,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:29:08,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:29:08,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2021-06-05 08:29:08,079 INFO L87 Difference]: Start difference. First operand 175022 states and 535481 transitions. Second operand has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:09,676 WARN L205 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2021-06-05 08:29:10,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:29:10,817 INFO L93 Difference]: Finished difference Result 186477 states and 567315 transitions. [2021-06-05 08:29:10,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 08:29:10,817 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:29:10,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:29:11,088 INFO L225 Difference]: With dead ends: 186477 [2021-06-05 08:29:11,088 INFO L226 Difference]: Without dead ends: 186119 [2021-06-05 08:29:11,089 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1856.2ms TimeCoverageRelationStatistics Valid=200, Invalid=1206, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 08:29:11,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186119 states. [2021-06-05 08:29:14,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186119 to 174709. [2021-06-05 08:29:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174709 states, 174707 states have (on average 3.059751469603393) internal successors, (534560), 174708 states have internal predecessors, (534560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174709 states to 174709 states and 534560 transitions. [2021-06-05 08:29:15,669 INFO L78 Accepts]: Start accepts. Automaton has 174709 states and 534560 transitions. Word has length 119 [2021-06-05 08:29:15,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:29:15,669 INFO L482 AbstractCegarLoop]: Abstraction has 174709 states and 534560 transitions. [2021-06-05 08:29:15,670 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:15,670 INFO L276 IsEmpty]: Start isEmpty. Operand 174709 states and 534560 transitions. [2021-06-05 08:29:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:29:15,951 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:29:15,952 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:29:16,165 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable322 [2021-06-05 08:29:16,165 INFO L430 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:29:16,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:29:16,166 INFO L82 PathProgramCache]: Analyzing trace with hash -901916829, now seen corresponding path program 16 times [2021-06-05 08:29:16,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:29:16,166 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141863193] [2021-06-05 08:29:16,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:29:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:29:16,485 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-05 08:29:16,485 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:29:16,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141863193] [2021-06-05 08:29:16,485 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141863193] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:29:16,485 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097063285] [2021-06-05 08:29:16,485 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:29:16,567 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:29:16,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:29:16,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 08:29:16,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:29:16,888 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:29:16,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2021-06-05 08:29:16,890 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:16,900 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:29:16,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-06-05 08:29:16,918 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:16,945 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:16,951 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:29:16,952 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:57 [2021-06-05 08:29:17,109 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:17,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2021-06-05 08:29:17,112 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:29:17,126 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:17,132 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:17,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:29:17,134 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2021-06-05 08:29:17,190 INFO L628 ElimStorePlain]: treesize reduction 9, result has 79.1 percent of original size [2021-06-05 08:29:17,192 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:29:17,192 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:57, output treesize:25 [2021-06-05 08:29:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-06-05 08:29:17,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097063285] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:29:17,222 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:29:17,222 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2021-06-05 08:29:17,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780120788] [2021-06-05 08:29:17,223 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 08:29:17,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:29:17,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 08:29:17,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2021-06-05 08:29:17,223 INFO L87 Difference]: Start difference. First operand 174709 states and 534560 transitions. Second operand has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:29:25,104 INFO L93 Difference]: Finished difference Result 269846 states and 818130 transitions. [2021-06-05 08:29:25,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 08:29:25,104 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:29:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:29:25,603 INFO L225 Difference]: With dead ends: 269846 [2021-06-05 08:29:25,603 INFO L226 Difference]: Without dead ends: 268854 [2021-06-05 08:29:25,603 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 1594.7ms TimeCoverageRelationStatistics Valid=452, Invalid=2628, Unknown=0, NotChecked=0, Total=3080 [2021-06-05 08:29:26,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268854 states. [2021-06-05 08:29:29,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268854 to 174793. [2021-06-05 08:29:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174793 states, 174791 states have (on average 3.060214770783393) internal successors, (534898), 174792 states have internal predecessors, (534898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174793 states to 174793 states and 534898 transitions. [2021-06-05 08:29:30,246 INFO L78 Accepts]: Start accepts. Automaton has 174793 states and 534898 transitions. Word has length 119 [2021-06-05 08:29:30,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:29:30,246 INFO L482 AbstractCegarLoop]: Abstraction has 174793 states and 534898 transitions. [2021-06-05 08:29:30,246 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:30,246 INFO L276 IsEmpty]: Start isEmpty. Operand 174793 states and 534898 transitions. [2021-06-05 08:29:30,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-06-05 08:29:30,504 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:29:30,504 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:29:30,705 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable345 [2021-06-05 08:29:30,705 INFO L430 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:29:30,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:29:30,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1386303451, now seen corresponding path program 17 times [2021-06-05 08:29:30,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:29:30,706 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252277044] [2021-06-05 08:29:30,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:29:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:29:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-05 08:29:30,831 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:29:30,831 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252277044] [2021-06-05 08:29:30,831 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252277044] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:29:30,831 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071344355] [2021-06-05 08:29:30,831 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:29:31,485 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 08:29:31,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:29:31,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 08:29:31,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:29:31,765 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:29:31,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-06-05 08:29:31,767 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:31,779 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:29:31,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 22 [2021-06-05 08:29:31,781 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:31,797 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:31,805 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:29:31,805 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:57 [2021-06-05 08:29:32,005 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:32,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:29:32,007 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:29:32,033 INFO L628 ElimStorePlain]: treesize reduction 4, result has 92.3 percent of original size [2021-06-05 08:29:32,039 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:29:32,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2021-06-05 08:29:32,040 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:32,051 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:32,052 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:29:32,053 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:57, output treesize:25 [2021-06-05 08:29:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-06-05 08:29:32,077 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071344355] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:29:32,077 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:29:32,077 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 24 [2021-06-05 08:29:32,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312987131] [2021-06-05 08:29:32,078 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 08:29:32,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:29:32,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 08:29:32,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:29:32,078 INFO L87 Difference]: Start difference. First operand 174793 states and 534898 transitions. Second operand has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:33,905 WARN L205 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2021-06-05 08:29:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:29:35,895 INFO L93 Difference]: Finished difference Result 267348 states and 811481 transitions. [2021-06-05 08:29:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 08:29:35,896 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-06-05 08:29:35,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:29:36,365 INFO L225 Difference]: With dead ends: 267348 [2021-06-05 08:29:36,365 INFO L226 Difference]: Without dead ends: 266310 [2021-06-05 08:29:36,366 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 2123.9ms TimeCoverageRelationStatistics Valid=449, Invalid=2203, Unknown=0, NotChecked=0, Total=2652 [2021-06-05 08:29:37,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266310 states. [2021-06-05 08:29:39,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266310 to 173205. [2021-06-05 08:29:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173205 states, 173203 states have (on average 3.058665265613182) internal successors, (529770), 173204 states have internal predecessors, (529770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173205 states to 173205 states and 529770 transitions. [2021-06-05 08:29:40,985 INFO L78 Accepts]: Start accepts. Automaton has 173205 states and 529770 transitions. Word has length 119 [2021-06-05 08:29:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:29:40,986 INFO L482 AbstractCegarLoop]: Abstraction has 173205 states and 529770 transitions. [2021-06-05 08:29:40,986 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 173205 states and 529770 transitions. [2021-06-05 08:29:41,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-06-05 08:29:41,235 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:29:41,235 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:29:41,435 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable367 [2021-06-05 08:29:41,436 INFO L430 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:29:41,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:29:41,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1478352036, now seen corresponding path program 1 times [2021-06-05 08:29:41,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:29:41,436 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585454826] [2021-06-05 08:29:41,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:29:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:29:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-06-05 08:29:41,583 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:29:41,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585454826] [2021-06-05 08:29:41,583 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585454826] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:29:41,583 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037282828] [2021-06-05 08:29:41,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:29:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:29:41,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 47 conjunts are in the unsatisfiable core [2021-06-05 08:29:41,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:29:41,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:29:41,674 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:41,677 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:41,677 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:29:41,677 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:29:41,715 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:29:41,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:29:41,717 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:41,722 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:41,724 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:29:41,724 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2021-06-05 08:29:41,786 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:29:41,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:29:41,788 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:41,793 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:41,794 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:29:41,794 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 08:29:41,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:29:41,817 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:41,821 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:41,822 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:29:41,822 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 08:29:41,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:29:41,839 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:41,844 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:41,845 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:29:41,845 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2021-06-05 08:29:42,191 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:29:42,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:29:42,193 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:42,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:42,206 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:29:42,206 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:27 [2021-06-05 08:29:42,257 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:42,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:29:42,261 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:29:42,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:29:42,264 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:42,282 INFO L628 ElimStorePlain]: treesize reduction 9, result has 71.9 percent of original size [2021-06-05 08:29:42,283 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:29:42,283 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:19 [2021-06-05 08:29:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-06-05 08:29:42,311 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037282828] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:29:42,311 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:29:42,311 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 30 [2021-06-05 08:29:42,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481561977] [2021-06-05 08:29:42,311 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 08:29:42,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:29:42,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 08:29:42,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:29:42,312 INFO L87 Difference]: Start difference. First operand 173205 states and 529770 transitions. Second operand has 30 states, 30 states have (on average 6.7) internal successors, (201), 30 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:46,008 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2021-06-05 08:29:50,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:29:50,192 INFO L93 Difference]: Finished difference Result 195662 states and 591324 transitions. [2021-06-05 08:29:50,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2021-06-05 08:29:50,193 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.7) internal successors, (201), 30 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2021-06-05 08:29:50,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:29:50,480 INFO L225 Difference]: With dead ends: 195662 [2021-06-05 08:29:50,480 INFO L226 Difference]: Without dead ends: 194916 [2021-06-05 08:29:50,481 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6187 ImplicationChecksByTransitivity, 5029.6ms TimeCoverageRelationStatistics Valid=3497, Invalid=15409, Unknown=0, NotChecked=0, Total=18906 [2021-06-05 08:29:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194916 states. [2021-06-05 08:29:53,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194916 to 174109. [2021-06-05 08:29:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174109 states, 174107 states have (on average 3.060238818657492) internal successors, (532809), 174108 states have internal predecessors, (532809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174109 states to 174109 states and 532809 transitions. [2021-06-05 08:29:54,397 INFO L78 Accepts]: Start accepts. Automaton has 174109 states and 532809 transitions. Word has length 120 [2021-06-05 08:29:54,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:29:54,398 INFO L482 AbstractCegarLoop]: Abstraction has 174109 states and 532809 transitions. [2021-06-05 08:29:54,398 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 6.7) internal successors, (201), 30 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:29:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 174109 states and 532809 transitions. [2021-06-05 08:29:54,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-06-05 08:29:54,653 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:29:54,653 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:29:54,869 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable390 [2021-06-05 08:29:54,869 INFO L430 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:29:54,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:29:54,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1136327519, now seen corresponding path program 1 times [2021-06-05 08:29:54,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:29:54,870 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145893083] [2021-06-05 08:29:54,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:29:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:29:54,972 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-06-05 08:29:54,972 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:29:54,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145893083] [2021-06-05 08:29:54,972 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145893083] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:29:54,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523859540] [2021-06-05 08:29:54,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:29:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:29:55,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 47 conjunts are in the unsatisfiable core [2021-06-05 08:29:55,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:29:55,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:29:55,635 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:55,638 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:55,638 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:29:55,638 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:29:55,677 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:29:55,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:29:55,679 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:55,685 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:55,687 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:29:55,687 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2021-06-05 08:29:55,771 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:29:55,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:29:55,773 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:55,778 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:55,779 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:29:55,779 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 08:29:55,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:29:55,799 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:55,804 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:55,805 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:29:55,805 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 08:29:55,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:29:55,819 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:55,823 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:55,824 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:29:55,824 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2021-06-05 08:29:56,145 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:29:56,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:29:56,146 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:56,155 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:56,158 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:29:56,159 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:27 [2021-06-05 08:29:56,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:29:56,198 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:56,203 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:29:56,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2021-06-05 08:29:56,204 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:29:56,212 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:29:56,213 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:29:56,213 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:19 [2021-06-05 08:29:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-06-05 08:29:56,238 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523859540] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:29:56,238 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:29:56,238 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 28 [2021-06-05 08:29:56,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708998770] [2021-06-05 08:29:56,238 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 08:29:56,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:29:56,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 08:29:56,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2021-06-05 08:29:56,238 INFO L87 Difference]: Start difference. First operand 174109 states and 532809 transitions. Second operand has 28 states, 28 states have (on average 7.285714285714286) internal successors, (204), 28 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:30:03,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:30:03,671 INFO L93 Difference]: Finished difference Result 210315 states and 637179 transitions. [2021-06-05 08:30:03,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2021-06-05 08:30:03,681 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.285714285714286) internal successors, (204), 28 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2021-06-05 08:30:03,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:30:04,274 INFO L225 Difference]: With dead ends: 210315 [2021-06-05 08:30:04,274 INFO L226 Difference]: Without dead ends: 209987 [2021-06-05 08:30:04,275 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6196 ImplicationChecksByTransitivity, 5325.8ms TimeCoverageRelationStatistics Valid=3449, Invalid=15457, Unknown=0, NotChecked=0, Total=18906 [2021-06-05 08:30:04,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209987 states. [2021-06-05 08:30:07,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209987 to 141687. [2021-06-05 08:30:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141687 states, 141685 states have (on average 3.0477397042735648) internal successors, (431819), 141686 states have internal predecessors, (431819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:30:07,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141687 states to 141687 states and 431819 transitions. [2021-06-05 08:30:07,652 INFO L78 Accepts]: Start accepts. Automaton has 141687 states and 431819 transitions. Word has length 120 [2021-06-05 08:30:07,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:30:07,652 INFO L482 AbstractCegarLoop]: Abstraction has 141687 states and 431819 transitions. [2021-06-05 08:30:07,652 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 7.285714285714286) internal successors, (204), 28 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:30:07,652 INFO L276 IsEmpty]: Start isEmpty. Operand 141687 states and 431819 transitions. [2021-06-05 08:30:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-06-05 08:30:07,841 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:30:07,841 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:30:08,042 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable401,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:30:08,044 INFO L430 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:30:08,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:30:08,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1994696088, now seen corresponding path program 2 times [2021-06-05 08:30:08,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:30:08,045 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445145142] [2021-06-05 08:30:08,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:30:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:30:08,193 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-06-05 08:30:08,193 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:30:08,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445145142] [2021-06-05 08:30:08,193 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445145142] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:30:08,193 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628010699] [2021-06-05 08:30:08,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:30:08,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 08:30:08,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:30:08,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 42 conjunts are in the unsatisfiable core [2021-06-05 08:30:08,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:30:08,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:30:08,300 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:08,303 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:08,303 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:30:08,303 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:30:08,338 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:30:08,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:30:08,340 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:08,345 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:08,346 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:30:08,346 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2021-06-05 08:30:08,409 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:30:08,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:30:08,411 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:08,416 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:08,417 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:30:08,417 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 08:30:08,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:30:08,441 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:08,445 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:08,446 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:30:08,447 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 08:30:08,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:30:08,468 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:08,472 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:08,473 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:30:08,473 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2021-06-05 08:30:08,708 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:30:08,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:30:08,710 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:08,717 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:08,723 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:30:08,723 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:27 [2021-06-05 08:30:08,857 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:08,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:30:08,859 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:30:08,873 INFO L628 ElimStorePlain]: treesize reduction 4, result has 81.8 percent of original size [2021-06-05 08:30:08,875 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:30:08,875 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2021-06-05 08:30:08,902 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-06-05 08:30:08,903 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628010699] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:30:08,903 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:30:08,903 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2021-06-05 08:30:08,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259324144] [2021-06-05 08:30:08,903 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 08:30:08,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:30:08,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 08:30:08,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2021-06-05 08:30:08,904 INFO L87 Difference]: Start difference. First operand 141687 states and 431819 transitions. Second operand has 29 states, 29 states have (on average 6.9655172413793105) internal successors, (202), 29 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:30:14,350 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2021-06-05 08:30:16,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:30:16,998 INFO L93 Difference]: Finished difference Result 163946 states and 492168 transitions. [2021-06-05 08:30:16,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2021-06-05 08:30:16,999 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 6.9655172413793105) internal successors, (202), 29 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2021-06-05 08:30:16,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:30:17,259 INFO L225 Difference]: With dead ends: 163946 [2021-06-05 08:30:17,259 INFO L226 Difference]: Without dead ends: 162986 [2021-06-05 08:30:17,261 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 107 SyntacticMatches, 3 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9322 ImplicationChecksByTransitivity, 5027.3ms TimeCoverageRelationStatistics Valid=3332, Invalid=22108, Unknown=0, NotChecked=0, Total=25440 [2021-06-05 08:30:17,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162986 states. [2021-06-05 08:30:19,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162986 to 141163. [2021-06-05 08:30:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141163 states, 141161 states have (on average 3.049092879761407) internal successors, (430413), 141162 states have internal predecessors, (430413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:30:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141163 states to 141163 states and 430413 transitions. [2021-06-05 08:30:20,227 INFO L78 Accepts]: Start accepts. Automaton has 141163 states and 430413 transitions. Word has length 120 [2021-06-05 08:30:20,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:30:20,227 INFO L482 AbstractCegarLoop]: Abstraction has 141163 states and 430413 transitions. [2021-06-05 08:30:20,227 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 6.9655172413793105) internal successors, (202), 29 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:30:20,227 INFO L276 IsEmpty]: Start isEmpty. Operand 141163 states and 430413 transitions. [2021-06-05 08:30:20,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-06-05 08:30:20,409 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:30:20,409 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:30:20,610 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable410 [2021-06-05 08:30:20,610 INFO L430 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:30:20,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:30:20,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1387306938, now seen corresponding path program 3 times [2021-06-05 08:30:20,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:30:20,611 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850343731] [2021-06-05 08:30:20,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:30:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:30:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-06-05 08:30:20,767 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:30:20,768 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850343731] [2021-06-05 08:30:20,768 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850343731] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:30:20,768 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720435459] [2021-06-05 08:30:20,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:30:21,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 08:30:21,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:30:21,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 30 conjunts are in the unsatisfiable core [2021-06-05 08:30:21,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:30:21,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:30:21,356 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:21,358 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:21,359 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:30:21,359 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:30:21,422 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:30:21,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:30:21,423 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:21,429 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:21,430 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:30:21,430 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2021-06-05 08:30:21,520 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:30:21,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:30:21,522 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:21,527 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:21,528 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:30:21,528 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 08:30:21,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:30:21,551 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:21,556 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:21,557 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:30:21,557 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 08:30:21,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:30:21,575 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:21,580 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:21,581 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:30:21,581 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2021-06-05 08:30:21,786 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:30:21,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 34 [2021-06-05 08:30:21,787 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:21,801 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:30:21,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2021-06-05 08:30:21,804 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:21,826 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:21,834 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2021-06-05 08:30:21,834 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:86, output treesize:73 [2021-06-05 08:30:22,000 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_43], 2=[|#memory_int|, v_prenex_45]} [2021-06-05 08:30:22,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:30:22,004 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:22,019 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:22,027 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-06-05 08:30:22,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2021-06-05 08:30:22,029 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:22,044 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:22,053 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-06-05 08:30:22,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 19 [2021-06-05 08:30:22,054 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:22,085 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:22,088 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-06-05 08:30:22,088 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:79, output treesize:28 [2021-06-05 08:30:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-06-05 08:30:22,116 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720435459] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:30:22,116 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:30:22,116 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2021-06-05 08:30:22,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644872924] [2021-06-05 08:30:22,117 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 08:30:22,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:30:22,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 08:30:22,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:30:22,117 INFO L87 Difference]: Start difference. First operand 141163 states and 430413 transitions. Second operand has 26 states, 26 states have (on average 7.6923076923076925) internal successors, (200), 26 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:30:27,571 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2021-06-05 08:30:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:30:27,990 INFO L93 Difference]: Finished difference Result 165552 states and 497287 transitions. [2021-06-05 08:30:27,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2021-06-05 08:30:27,991 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.6923076923076925) internal successors, (200), 26 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2021-06-05 08:30:27,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:30:28,253 INFO L225 Difference]: With dead ends: 165552 [2021-06-05 08:30:28,254 INFO L226 Difference]: Without dead ends: 164732 [2021-06-05 08:30:28,254 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3515 ImplicationChecksByTransitivity, 3640.5ms TimeCoverageRelationStatistics Valid=1758, Invalid=9584, Unknown=0, NotChecked=0, Total=11342 [2021-06-05 08:30:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164732 states. [2021-06-05 08:30:30,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164732 to 141969. [2021-06-05 08:30:30,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141969 states, 141967 states have (on average 3.0484478787323814) internal successors, (432779), 141968 states have internal predecessors, (432779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:30:31,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141969 states to 141969 states and 432779 transitions. [2021-06-05 08:30:31,317 INFO L78 Accepts]: Start accepts. Automaton has 141969 states and 432779 transitions. Word has length 120 [2021-06-05 08:30:31,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:30:31,317 INFO L482 AbstractCegarLoop]: Abstraction has 141969 states and 432779 transitions. [2021-06-05 08:30:31,317 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 7.6923076923076925) internal successors, (200), 26 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:30:31,318 INFO L276 IsEmpty]: Start isEmpty. Operand 141969 states and 432779 transitions. [2021-06-05 08:30:31,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-06-05 08:30:31,502 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:30:31,502 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:30:31,717 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable419 [2021-06-05 08:30:31,717 INFO L430 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:30:31,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:30:31,718 INFO L82 PathProgramCache]: Analyzing trace with hash -2036757680, now seen corresponding path program 4 times [2021-06-05 08:30:31,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:30:31,718 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298921751] [2021-06-05 08:30:31,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:30:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:30:31,846 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-06-05 08:30:31,847 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:30:31,847 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298921751] [2021-06-05 08:30:31,847 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298921751] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:30:31,847 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940859390] [2021-06-05 08:30:31,847 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:30:31,979 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:30:31,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:30:31,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 46 conjunts are in the unsatisfiable core [2021-06-05 08:30:31,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:30:32,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:30:32,035 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:32,038 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:32,039 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:30:32,039 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2021-06-05 08:30:32,075 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:30:32,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 28 [2021-06-05 08:30:32,078 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:32,086 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:32,087 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:30:32,087 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2021-06-05 08:30:32,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:30:32,134 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:32,143 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-06-05 08:30:32,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:30:32,144 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:32,582 WARN L205 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-06-05 08:30:32,582 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:32,583 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 08:30:32,583 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 [2021-06-05 08:30:32,722 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:30:32,722 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:30:32,723 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:32,734 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:30:32,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:30:32,736 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:32,747 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:32,754 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2021-06-05 08:30:32,754 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2021-06-05 08:30:32,945 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:30:32,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:30:32,946 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:32,958 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:30:32,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:30:32,959 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:32,974 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:32,975 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:30:32,975 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:28 [2021-06-05 08:30:33,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 21 [2021-06-05 08:30:33,227 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:33,238 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:30:33,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:30:33,240 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:33,256 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:33,262 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:30:33,262 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:104, output treesize:50 [2021-06-05 08:30:33,458 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:33,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:30:33,460 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:30:33,485 INFO L628 ElimStorePlain]: treesize reduction 4, result has 91.8 percent of original size [2021-06-05 08:30:33,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-06-05 08:30:33,488 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:33,498 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:33,500 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:30:33,500 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:54, output treesize:17 [2021-06-05 08:30:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-05 08:30:33,523 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940859390] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:30:33,523 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:30:33,523 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2021-06-05 08:30:33,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324040156] [2021-06-05 08:30:33,524 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 08:30:33,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:30:33,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 08:30:33,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:30:33,524 INFO L87 Difference]: Start difference. First operand 141969 states and 432779 transitions. Second operand has 30 states, 30 states have (on average 6.8) internal successors, (204), 30 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:30:35,273 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2021-06-05 08:30:41,732 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-06-05 08:30:41,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:30:41,828 INFO L93 Difference]: Finished difference Result 175112 states and 527697 transitions. [2021-06-05 08:30:41,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2021-06-05 08:30:41,828 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 6.8) internal successors, (204), 30 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2021-06-05 08:30:41,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:30:42,100 INFO L225 Difference]: With dead ends: 175112 [2021-06-05 08:30:42,100 INFO L226 Difference]: Without dead ends: 174090 [2021-06-05 08:30:42,101 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6343 ImplicationChecksByTransitivity, 6262.8ms TimeCoverageRelationStatistics Valid=2420, Invalid=15940, Unknown=0, NotChecked=0, Total=18360 [2021-06-05 08:30:42,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174090 states. [2021-06-05 08:30:44,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174090 to 148623. [2021-06-05 08:30:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148623 states, 148621 states have (on average 3.0547701872548294) internal successors, (454003), 148622 states have internal predecessors, (454003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:30:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148623 states to 148623 states and 454003 transitions. [2021-06-05 08:30:45,220 INFO L78 Accepts]: Start accepts. Automaton has 148623 states and 454003 transitions. Word has length 120 [2021-06-05 08:30:45,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:30:45,221 INFO L482 AbstractCegarLoop]: Abstraction has 148623 states and 454003 transitions. [2021-06-05 08:30:45,221 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 6.8) internal successors, (204), 30 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:30:45,221 INFO L276 IsEmpty]: Start isEmpty. Operand 148623 states and 454003 transitions. [2021-06-05 08:30:45,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-06-05 08:30:45,430 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:30:45,430 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:30:45,630 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable439,51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:30:45,631 INFO L430 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:30:45,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:30:45,631 INFO L82 PathProgramCache]: Analyzing trace with hash 237687844, now seen corresponding path program 5 times [2021-06-05 08:30:45,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:30:45,631 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524523626] [2021-06-05 08:30:45,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:30:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:30:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-06-05 08:30:45,776 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:30:45,776 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524523626] [2021-06-05 08:30:45,776 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524523626] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:30:45,776 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70739883] [2021-06-05 08:30:45,776 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:30:45,877 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-06-05 08:30:45,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:30:45,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 40 conjunts are in the unsatisfiable core [2021-06-05 08:30:45,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:30:45,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:30:45,890 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:45,892 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:45,893 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:30:45,893 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:30:45,928 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-06-05 08:30:45,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-06-05 08:30:45,929 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:45,933 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:45,934 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:30:45,934 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2021-06-05 08:30:45,962 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:30:45,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 08:30:45,964 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:45,967 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:45,967 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:30:45,968 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2021-06-05 08:30:45,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:30:45,988 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:45,992 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:45,993 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:30:45,993 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 08:30:46,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:30:46,009 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:46,014 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:46,015 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:30:46,015 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2021-06-05 08:30:46,820 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:30:46,821 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:30:46,822 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:46,830 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:46,835 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:30:46,836 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:27 [2021-06-05 08:30:46,876 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:46,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:30:46,879 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:30:46,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:30:46,882 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:46,900 INFO L628 ElimStorePlain]: treesize reduction 9, result has 71.9 percent of original size [2021-06-05 08:30:46,901 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:30:46,901 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:19 [2021-06-05 08:30:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-06-05 08:30:46,925 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70739883] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:30:46,926 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:30:46,926 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2021-06-05 08:30:46,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541986151] [2021-06-05 08:30:46,926 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 08:30:46,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:30:46,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 08:30:46,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2021-06-05 08:30:46,926 INFO L87 Difference]: Start difference. First operand 148623 states and 454003 transitions. Second operand has 27 states, 27 states have (on average 7.7407407407407405) internal successors, (209), 27 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:30:52,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:30:52,707 INFO L93 Difference]: Finished difference Result 190247 states and 575798 transitions. [2021-06-05 08:30:52,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2021-06-05 08:30:52,708 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.7407407407407405) internal successors, (209), 27 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2021-06-05 08:30:52,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:30:53,042 INFO L225 Difference]: With dead ends: 190247 [2021-06-05 08:30:53,042 INFO L226 Difference]: Without dead ends: 189995 [2021-06-05 08:30:53,043 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5163 ImplicationChecksByTransitivity, 3755.8ms TimeCoverageRelationStatistics Valid=2638, Invalid=12862, Unknown=0, NotChecked=0, Total=15500 [2021-06-05 08:30:53,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189995 states. [2021-06-05 08:30:55,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189995 to 148917. [2021-06-05 08:30:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148917 states, 148915 states have (on average 3.054702346976463) internal successors, (454891), 148916 states have internal predecessors, (454891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:30:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148917 states to 148917 states and 454891 transitions. [2021-06-05 08:30:56,198 INFO L78 Accepts]: Start accepts. Automaton has 148917 states and 454891 transitions. Word has length 120 [2021-06-05 08:30:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:30:56,198 INFO L482 AbstractCegarLoop]: Abstraction has 148917 states and 454891 transitions. [2021-06-05 08:30:56,198 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 7.7407407407407405) internal successors, (209), 27 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:30:56,198 INFO L276 IsEmpty]: Start isEmpty. Operand 148917 states and 454891 transitions. [2021-06-05 08:30:56,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-06-05 08:30:56,396 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:30:56,397 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:30:56,600 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable461,52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:30:56,601 INFO L430 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:30:56,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:30:56,601 INFO L82 PathProgramCache]: Analyzing trace with hash -38149348, now seen corresponding path program 6 times [2021-06-05 08:30:56,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:30:56,601 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999567332] [2021-06-05 08:30:56,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:30:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:30:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-06-05 08:30:57,235 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:30:57,235 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999567332] [2021-06-05 08:30:57,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999567332] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:30:57,235 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979455621] [2021-06-05 08:30:57,236 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:30:57,319 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 08:30:57,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:30:57,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 36 conjunts are in the unsatisfiable core [2021-06-05 08:30:57,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:30:57,347 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:30:57,348 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:57,350 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:57,350 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:30:57,350 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:30:57,410 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:30:57,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:30:57,412 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:57,418 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:57,419 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:30:57,419 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2021-06-05 08:30:57,499 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:30:57,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:30:57,501 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:57,507 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:57,508 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:30:57,508 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 08:30:57,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:30:57,563 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:57,567 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:57,568 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:30:57,568 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 08:30:57,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:30:57,582 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:57,586 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:57,587 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:30:57,587 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2021-06-05 08:30:57,822 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:30:57,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 34 [2021-06-05 08:30:57,824 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:57,833 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:57,838 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:30:57,838 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:31 [2021-06-05 08:30:57,880 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:30:57,881 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:57,887 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-06-05 08:30:57,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 19 [2021-06-05 08:30:57,889 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:30:57,898 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:30:57,899 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:30:57,899 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:19 [2021-06-05 08:30:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-05 08:30:57,924 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979455621] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:30:57,924 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:30:57,924 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2021-06-05 08:30:57,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196981656] [2021-06-05 08:30:57,924 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 08:30:57,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:30:57,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 08:30:57,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2021-06-05 08:30:57,925 INFO L87 Difference]: Start difference. First operand 148917 states and 454891 transitions. Second operand has 27 states, 27 states have (on average 7.62962962962963) internal successors, (206), 27 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:31:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:31:02,110 INFO L93 Difference]: Finished difference Result 182945 states and 555471 transitions. [2021-06-05 08:31:02,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-06-05 08:31:02,110 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 7.62962962962963) internal successors, (206), 27 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2021-06-05 08:31:02,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:31:02,594 INFO L225 Difference]: With dead ends: 182945 [2021-06-05 08:31:02,594 INFO L226 Difference]: Without dead ends: 182693 [2021-06-05 08:31:02,594 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 2367.8ms TimeCoverageRelationStatistics Valid=1253, Invalid=5389, Unknown=0, NotChecked=0, Total=6642 [2021-06-05 08:31:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182693 states. [2021-06-05 08:31:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182693 to 148895. [2021-06-05 08:31:05,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148895 states, 148893 states have (on average 3.054723862102315) internal successors, (454827), 148894 states have internal predecessors, (454827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:31:05,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148895 states to 148895 states and 454827 transitions. [2021-06-05 08:31:05,715 INFO L78 Accepts]: Start accepts. Automaton has 148895 states and 454827 transitions. Word has length 120 [2021-06-05 08:31:05,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:31:05,716 INFO L482 AbstractCegarLoop]: Abstraction has 148895 states and 454827 transitions. [2021-06-05 08:31:05,716 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 7.62962962962963) internal successors, (206), 27 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:31:05,716 INFO L276 IsEmpty]: Start isEmpty. Operand 148895 states and 454827 transitions. [2021-06-05 08:31:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-06-05 08:31:05,909 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:31:05,909 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:31:06,109 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable470,53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:31:06,110 INFO L430 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:31:06,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:31:06,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1959262388, now seen corresponding path program 7 times [2021-06-05 08:31:06,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:31:06,110 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514449906] [2021-06-05 08:31:06,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:31:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:31:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-06-05 08:31:06,235 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:31:06,235 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514449906] [2021-06-05 08:31:06,235 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514449906] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:31:06,235 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421112301] [2021-06-05 08:31:06,235 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:31:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:31:06,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 47 conjunts are in the unsatisfiable core [2021-06-05 08:31:06,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:31:06,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 08:31:06,370 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:31:06,373 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:31:06,373 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:31:06,374 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:31:06,423 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:31:06,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-06-05 08:31:06,424 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:31:06,431 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:31:06,432 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:31:06,432 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2021-06-05 08:31:06,507 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:31:06,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 08:31:06,509 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:31:06,515 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:31:06,518 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:31:06,518 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2021-06-05 08:31:06,543 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:31:06,544 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:31:06,549 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:31:06,550 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:31:06,550 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 08:31:06,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-06-05 08:31:06,571 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:31:06,577 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:31:06,578 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:31:06,578 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2021-06-05 08:31:06,915 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:31:06,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 30 [2021-06-05 08:31:06,917 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:31:06,925 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:31:06,945 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:31:06,945 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:27 [2021-06-05 08:31:06,987 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:31:06,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:31:06,990 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2021-06-05 08:31:06,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-06-05 08:31:06,993 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:31:07,012 INFO L628 ElimStorePlain]: treesize reduction 9, result has 71.9 percent of original size [2021-06-05 08:31:07,463 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:31:07,463 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:19 [2021-06-05 08:31:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-06-05 08:31:07,505 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421112301] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:31:07,505 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:31:07,505 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 28 [2021-06-05 08:31:07,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516512343] [2021-06-05 08:31:07,506 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 08:31:07,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:31:07,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 08:31:07,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2021-06-05 08:31:07,506 INFO L87 Difference]: Start difference. First operand 148895 states and 454827 transitions. Second operand has 28 states, 28 states have (on average 7.357142857142857) internal successors, (206), 28 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:31:10,395 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2021-06-05 08:31:14,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:31:14,808 INFO L93 Difference]: Finished difference Result 193583 states and 583582 transitions. [2021-06-05 08:31:14,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2021-06-05 08:31:14,808 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.357142857142857) internal successors, (206), 28 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2021-06-05 08:31:14,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:31:15,105 INFO L225 Difference]: With dead ends: 193583 [2021-06-05 08:31:15,106 INFO L226 Difference]: Without dead ends: 193289 [2021-06-05 08:31:15,107 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5594 ImplicationChecksByTransitivity, 5026.1ms TimeCoverageRelationStatistics Valid=3414, Invalid=13878, Unknown=0, NotChecked=0, Total=17292 [2021-06-05 08:31:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193289 states. [2021-06-05 08:31:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193289 to 146506. [2021-06-05 08:31:18,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146506 states, 146504 states have (on average 3.046879266095124) internal successors, (446380), 146505 states have internal predecessors, (446380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:31:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146506 states to 146506 states and 446380 transitions. [2021-06-05 08:31:18,530 INFO L78 Accepts]: Start accepts. Automaton has 146506 states and 446380 transitions. Word has length 120 [2021-06-05 08:31:18,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:31:18,531 INFO L482 AbstractCegarLoop]: Abstraction has 146506 states and 446380 transitions. [2021-06-05 08:31:18,531 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 7.357142857142857) internal successors, (206), 28 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:31:18,531 INFO L276 IsEmpty]: Start isEmpty. Operand 146506 states and 446380 transitions. [2021-06-05 08:31:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-06-05 08:31:18,721 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:31:18,722 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:31:18,922 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable478 [2021-06-05 08:31:18,922 INFO L430 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:31:18,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:31:18,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1157562093, now seen corresponding path program 1 times [2021-06-05 08:31:18,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:31:18,923 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71800890] [2021-06-05 08:31:18,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:31:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:31:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 08:31:19,038 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:31:19,039 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71800890] [2021-06-05 08:31:19,039 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71800890] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:31:19,039 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929236487] [2021-06-05 08:31:19,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:31:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:31:19,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 48 conjunts are in the unsatisfiable core [2021-06-05 08:31:19,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:31:19,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:31:19,289 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:31:19,303 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:31:19,314 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:31:19,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2021-06-05 08:31:19,315 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:31:19,333 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:31:19,336 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:31:19,336 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:52 [2021-06-05 08:31:19,537 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:31:19,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2021-06-05 08:31:19,539 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:31:19,546 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:31:19,547 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:31:19,547 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2021-06-05 08:31:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-06-05 08:31:19,595 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929236487] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:31:19,595 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:31:19,595 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 23 [2021-06-05 08:31:19,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278385410] [2021-06-05 08:31:19,595 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 08:31:19,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:31:19,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 08:31:19,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2021-06-05 08:31:19,596 INFO L87 Difference]: Start difference. First operand 146506 states and 446380 transitions. Second operand has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:31:20,680 WARN L205 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2021-06-05 08:31:22,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:31:22,915 INFO L93 Difference]: Finished difference Result 195220 states and 585540 transitions. [2021-06-05 08:31:22,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 08:31:22,916 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2021-06-05 08:31:22,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:31:23,415 INFO L225 Difference]: With dead ends: 195220 [2021-06-05 08:31:23,415 INFO L226 Difference]: Without dead ends: 195010 [2021-06-05 08:31:23,416 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 2157.9ms TimeCoverageRelationStatistics Valid=748, Invalid=2558, Unknown=0, NotChecked=0, Total=3306 [2021-06-05 08:31:23,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195010 states. [2021-06-05 08:31:26,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195010 to 157474. [2021-06-05 08:31:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157474 states, 157472 states have (on average 3.0496532716927454) internal successors, (480235), 157473 states have internal predecessors, (480235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:31:26,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157474 states to 157474 states and 480235 transitions. [2021-06-05 08:31:26,791 INFO L78 Accepts]: Start accepts. Automaton has 157474 states and 480235 transitions. Word has length 123 [2021-06-05 08:31:26,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:31:26,791 INFO L482 AbstractCegarLoop]: Abstraction has 157474 states and 480235 transitions. [2021-06-05 08:31:26,792 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:31:26,792 INFO L276 IsEmpty]: Start isEmpty. Operand 157474 states and 480235 transitions. [2021-06-05 08:31:27,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-06-05 08:31:27,526 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:31:27,526 INFO L521 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:31:27,740 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable489 [2021-06-05 08:31:27,741 INFO L430 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:31:27,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:31:27,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1461530605, now seen corresponding path program 2 times [2021-06-05 08:31:27,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:31:27,741 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171240084] [2021-06-05 08:31:27,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:31:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:31:27,858 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-05 08:31:27,858 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:31:27,858 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171240084] [2021-06-05 08:31:27,858 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171240084] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:31:27,858 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637472484] [2021-06-05 08:31:27,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:31:27,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 08:31:27,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:31:27,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 08:31:27,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:31:28,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-06-05 08:31:28,123 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:31:28,139 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:31:28,149 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:31:28,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2021-06-05 08:31:28,150 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:31:28,166 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:31:28,168 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:31:28,169 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:52 [2021-06-05 08:31:28,362 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:31:28,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2021-06-05 08:31:28,364 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:31:28,377 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:31:28,382 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:31:28,382 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2021-06-05 08:31:28,385 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:31:28,399 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:31:28,401 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:31:28,401 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:28 [2021-06-05 08:31:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-06-05 08:31:28,478 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637472484] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:31:28,478 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:31:28,479 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 24 [2021-06-05 08:31:28,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206884314] [2021-06-05 08:31:28,479 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 08:31:28,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:31:28,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 08:31:28,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:31:28,479 INFO L87 Difference]: Start difference. First operand 157474 states and 480235 transitions. Second operand has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 08:31:31,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:31:31,779 INFO L93 Difference]: Finished difference Result 194542 states and 584278 transitions. [2021-06-05 08:31:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-06-05 08:31:31,779 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.384615384615385) internal successors, (109), 13 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2021-06-05 08:31:31,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:31:32,084 INFO L225 Difference]: With dead ends: 194542 [2021-06-05 08:31:32,085 INFO L226 Difference]: Without dead ends: 194422 [2021-06-05 08:31:32,085 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 1726.0ms TimeCoverageRelationStatistics Valid=590, Invalid=2602, Unknown=0, NotChecked=0, Total=3192