/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/36_stack_cas_p0_vs_concur.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 08:53:55,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 08:53:55,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 08:53:55,963 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 08:53:55,964 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 08:53:55,964 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 08:53:55,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 08:53:55,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 08:53:55,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 08:53:55,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 08:53:55,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 08:53:55,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 08:53:55,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 08:53:55,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 08:53:55,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 08:53:55,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 08:53:55,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 08:53:55,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 08:53:55,991 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 08:53:55,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 08:53:55,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 08:53:55,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 08:53:55,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 08:53:55,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 08:53:55,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 08:53:55,998 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 08:53:55,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 08:53:55,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 08:53:55,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 08:53:55,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 08:53:55,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 08:53:56,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 08:53:56,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 08:53:56,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 08:53:56,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 08:53:56,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 08:53:56,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 08:53:56,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 08:53:56,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 08:53:56,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 08:53:56,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 08:53:56,003 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:53:56,021 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 08:53:56,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 08:53:56,021 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 08:53:56,021 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 08:53:56,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 08:53:56,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 08:53:56,022 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 08:53:56,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 08:53:56,023 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 08:53:56,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 08:53:56,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 08:53:56,023 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 08:53:56,023 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 08:53:56,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 08:53:56,023 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 08:53:56,023 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 08:53:56,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 08:53:56,024 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 08:53:56,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 08:53:56,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 08:53:56,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 08:53:56,024 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 08:53:56,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 08:53:56,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 08:53:56,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 08:53:56,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 08:53:56,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 08:53:56,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 08:53:56,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 08:53:56,025 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 08:53:56,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 08:53:56,025 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 08:53:56,025 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:53:56,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 08:53:56,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 08:53:56,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 08:53:56,288 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 08:53:56,288 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 08:53:56,289 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2021-06-05 08:53:56,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db675fc8/cf9b65a1835245c59fe96ef6bdce5550/FLAGb5e98a04b [2021-06-05 08:53:56,724 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 08:53:56,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2021-06-05 08:53:56,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db675fc8/cf9b65a1835245c59fe96ef6bdce5550/FLAGb5e98a04b [2021-06-05 08:53:57,071 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db675fc8/cf9b65a1835245c59fe96ef6bdce5550 [2021-06-05 08:53:57,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 08:53:57,074 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 08:53:57,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 08:53:57,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 08:53:57,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 08:53:57,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 08:53:57" (1/1) ... [2021-06-05 08:53:57,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fac2892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:53:57, skipping insertion in model container [2021-06-05 08:53:57,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 08:53:57" (1/1) ... [2021-06-05 08:53:57,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 08:53:57,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 08:53:57,310 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/36_stack_cas_p0_vs_concur.i[30687,30700] [2021-06-05 08:53:57,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 08:53:57,319 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 08:53:57,341 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/36_stack_cas_p0_vs_concur.i[30687,30700] [2021-06-05 08:53:57,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 08:53:57,385 INFO L208 MainTranslator]: Completed translation [2021-06-05 08:53:57,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:53:57 WrapperNode [2021-06-05 08:53:57,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 08:53:57,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 08:53:57,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 08:53:57,387 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 08:53:57,391 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:53:57" (1/1) ... [2021-06-05 08:53:57,399 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:53:57" (1/1) ... [2021-06-05 08:53:57,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 08:53:57,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 08:53:57,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 08:53:57,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 08:53:57,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:53:57" (1/1) ... [2021-06-05 08:53:57,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:53:57" (1/1) ... [2021-06-05 08:53:57,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:53:57" (1/1) ... [2021-06-05 08:53:57,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:53:57" (1/1) ... [2021-06-05 08:53:57,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:53:57" (1/1) ... [2021-06-05 08:53:57,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:53:57" (1/1) ... [2021-06-05 08:53:57,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:53:57" (1/1) ... [2021-06-05 08:53:57,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 08:53:57,428 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 08:53:57,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 08:53:57,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 08:53:57,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:53:57" (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:53:57,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 08:53:57,475 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2021-06-05 08:53:57,476 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2021-06-05 08:53:57,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 08:53:57,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 08:53:57,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 08:53:57,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 08:53:57,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 08:53:57,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 08:53:57,479 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:53:57,979 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 08:53:57,980 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-06-05 08:53:57,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 08:53:57 BoogieIcfgContainer [2021-06-05 08:53:57,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 08:53:57,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 08:53:57,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 08:53:57,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 08:53:57,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 08:53:57" (1/3) ... [2021-06-05 08:53:57,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36643f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 08:53:57, skipping insertion in model container [2021-06-05 08:53:57,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 08:53:57" (2/3) ... [2021-06-05 08:53:57,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36643f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 08:53:57, skipping insertion in model container [2021-06-05 08:53:57,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 08:53:57" (3/3) ... [2021-06-05 08:53:57,987 INFO L111 eAbstractionObserver]: Analyzing ICFG 36_stack_cas_p0_vs_concur.i [2021-06-05 08:53:57,992 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 08:53:57,992 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 08:53:57,992 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-06-05 08:53:57,993 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 08:53:58,018 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,019 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,019 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,020 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,020 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,021 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,021 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,022 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,022 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,023 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,023 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,024 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,024 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,025 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,025 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,026 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,026 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,027 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,027 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,028 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,029 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:53:58,029 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:53:58,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,029 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,030 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:53:58,030 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:53:58,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,030 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,030 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,030 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:53:58,031 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:53:58,031 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:53:58,031 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:53:58,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,031 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,032 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:53:58,032 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:53:58,033 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:53:58,034 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:53:58,037 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,038 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,039 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,039 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,040 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,041 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,041 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,042 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,043 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,043 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,044 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:53:58,044 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:53:58,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,044 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:53:58,044 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:53:58,044 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:53:58,044 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:53:58,044 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,044 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:53:58,044 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:53:58,044 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:53:58,045 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:53:58,045 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:53:58,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,045 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,045 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:53:58,045 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:53:58,045 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,046 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:53:58,046 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:53:58,046 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:53:58,046 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:53:58,046 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,046 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:53:58,046 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:53:58,046 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:53:58,046 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:53:58,046 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:53:58,046 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,047 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,048 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,049 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,049 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,049 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,049 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,049 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,049 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,050 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,051 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,051 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,051 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:53:58,051 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,051 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,051 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,051 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:53:58,051 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:53:58,051 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,051 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,052 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,052 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:53:58,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,059 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,060 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,061 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:53:58,061 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,062 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,062 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,062 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:53:58,062 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:53:58,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,062 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,062 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,062 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:53:58,063 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:53:58,063 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:53:58,063 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:53:58,063 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,063 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:53:58,063 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:53:58,063 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,064 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:53:58,069 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 08:53:58,085 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-06-05 08:53:58,104 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:53:58,105 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:53:58,105 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:53:58,105 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:53:58,105 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:53:58,105 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:53:58,105 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:53:58,105 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 08:53:58,113 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 88 transitions, 181 flow [2021-06-05 08:53:58,136 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 713 states, 708 states have (on average 2.110169491525424) internal successors, (1494), 712 states have internal predecessors, (1494), 0 states have call successors, (0), 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:53:58,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 713 states, 708 states have (on average 2.110169491525424) internal successors, (1494), 712 states have internal predecessors, (1494), 0 states have call successors, (0), 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:53:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-06-05 08:53:58,150 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:53:58,151 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] [2021-06-05 08:53:58,151 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:53:58,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:53:58,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1934373064, now seen corresponding path program 1 times [2021-06-05 08:53:58,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:53:58,160 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723077507] [2021-06-05 08:53:58,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:53:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:53:58,336 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:53:58,336 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:53:58,336 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723077507] [2021-06-05 08:53:58,337 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723077507] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:53:58,337 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:53:58,337 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 08:53:58,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437539879] [2021-06-05 08:53:58,340 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 08:53:58,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:53:58,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 08:53:58,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 08:53:58,350 INFO L87 Difference]: Start difference. First operand has 713 states, 708 states have (on average 2.110169491525424) internal successors, (1494), 712 states have internal predecessors, (1494), 0 states have call successors, (0), 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 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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:53:58,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:53:58,364 INFO L93 Difference]: Finished difference Result 379 states and 710 transitions. [2021-06-05 08:53:58,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 08:53:58,365 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-06-05 08:53:58,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:53:58,372 INFO L225 Difference]: With dead ends: 379 [2021-06-05 08:53:58,372 INFO L226 Difference]: Without dead ends: 371 [2021-06-05 08:53:58,373 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:53:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-06-05 08:53:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2021-06-05 08:53:58,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 1.8783783783783783) internal successors, (695), 370 states have internal predecessors, (695), 0 states have call successors, (0), 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:53:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 695 transitions. [2021-06-05 08:53:58,409 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 695 transitions. Word has length 43 [2021-06-05 08:53:58,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:53:58,409 INFO L482 AbstractCegarLoop]: Abstraction has 371 states and 695 transitions. [2021-06-05 08:53:58,409 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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:53:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 695 transitions. [2021-06-05 08:53:58,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 08:53:58,411 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:53:58,411 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] [2021-06-05 08:53:58,411 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 08:53:58,411 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:53:58,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:53:58,412 INFO L82 PathProgramCache]: Analyzing trace with hash -775513643, now seen corresponding path program 1 times [2021-06-05 08:53:58,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:53:58,412 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519791238] [2021-06-05 08:53:58,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:53:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:53:58,666 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:53:58,667 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:53:58,667 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519791238] [2021-06-05 08:53:58,667 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519791238] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:53:58,667 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:53:58,667 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 08:53:58,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493712530] [2021-06-05 08:53:58,669 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 08:53:58,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:53:58,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 08:53:58,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 08:53:58,670 INFO L87 Difference]: Start difference. First operand 371 states and 695 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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:53:59,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:53:59,019 INFO L93 Difference]: Finished difference Result 789 states and 1486 transitions. [2021-06-05 08:53:59,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 08:53:59,019 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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:53:59,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:53:59,024 INFO L225 Difference]: With dead ends: 789 [2021-06-05 08:53:59,024 INFO L226 Difference]: Without dead ends: 789 [2021-06-05 08:53:59,025 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 224.7ms TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:53:59,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2021-06-05 08:53:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 643. [2021-06-05 08:53:59,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 1.8894080996884735) internal successors, (1213), 642 states have internal predecessors, (1213), 0 states have call successors, (0), 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:53:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1213 transitions. [2021-06-05 08:53:59,068 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 1213 transitions. Word has length 55 [2021-06-05 08:53:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:53:59,068 INFO L482 AbstractCegarLoop]: Abstraction has 643 states and 1213 transitions. [2021-06-05 08:53:59,068 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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:53:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 1213 transitions. [2021-06-05 08:53:59,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 08:53:59,070 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:53:59,070 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] [2021-06-05 08:53:59,070 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 08:53:59,070 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:53:59,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:53:59,071 INFO L82 PathProgramCache]: Analyzing trace with hash -153134957, now seen corresponding path program 1 times [2021-06-05 08:53:59,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:53:59,071 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637635043] [2021-06-05 08:53:59,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:53:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:53:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:53:59,420 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:53:59,420 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637635043] [2021-06-05 08:53:59,421 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637635043] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:53:59,421 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904984922] [2021-06-05 08:53:59,421 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:53:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:53:59,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 53 conjunts are in the unsatisfiable core [2021-06-05 08:53:59,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:53:59,562 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:53:59,563 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:53:59,575 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:53:59,576 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:53:59,576 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:53:59,619 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:53:59,619 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:53:59,622 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:53:59,625 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:53:59,626 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:53:59,626 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 08:53:59,720 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:53:59,721 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:53:59,727 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:53:59,728 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:53:59,728 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 08:53:59,907 INFO L354 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2021-06-05 08:53:59,907 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 2 case distinctions, treesize of input 43 treesize of output 25 [2021-06-05 08:53:59,910 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:53:59,923 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:53:59,923 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:53:59,928 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:53:59,946 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:53:59,950 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 08:53:59,950 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:55 [2021-06-05 08:54:00,202 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 08:54:00,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2021-06-05 08:54:00,205 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:00,214 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:00,221 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:00,221 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:11 [2021-06-05 08:54:00,248 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:54:00,250 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:00,251 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:00,251 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:54:00,251 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:54:00,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:54:00,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904984922] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:00,270 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:54:00,270 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2021-06-05 08:54:00,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224379804] [2021-06-05 08:54:00,271 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 08:54:00,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:54:00,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 08:54:00,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:54:00,272 INFO L87 Difference]: Start difference. First operand 643 states and 1213 transitions. Second operand has 26 states, 26 states have (on average 4.038461538461538) internal successors, (105), 26 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:54:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:54:02,277 INFO L93 Difference]: Finished difference Result 1127 states and 2045 transitions. [2021-06-05 08:54:02,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-06-05 08:54:02,277 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.038461538461538) internal successors, (105), 26 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 61 [2021-06-05 08:54:02,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:54:02,281 INFO L225 Difference]: With dead ends: 1127 [2021-06-05 08:54:02,281 INFO L226 Difference]: Without dead ends: 1127 [2021-06-05 08:54:02,282 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 1819.6ms TimeCoverageRelationStatistics Valid=497, Invalid=3285, Unknown=0, NotChecked=0, Total=3782 [2021-06-05 08:54:02,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2021-06-05 08:54:02,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 655. [2021-06-05 08:54:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 654 states have (on average 1.8883792048929664) internal successors, (1235), 654 states have internal predecessors, (1235), 0 states have call successors, (0), 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:54:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1235 transitions. [2021-06-05 08:54:02,295 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1235 transitions. Word has length 61 [2021-06-05 08:54:02,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:54:02,296 INFO L482 AbstractCegarLoop]: Abstraction has 655 states and 1235 transitions. [2021-06-05 08:54:02,296 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 4.038461538461538) internal successors, (105), 26 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:54:02,296 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1235 transitions. [2021-06-05 08:54:02,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 08:54:02,297 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:54:02,297 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] [2021-06-05 08:54:02,515 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-06-05 08:54:02,515 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:54:02,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:54:02,515 INFO L82 PathProgramCache]: Analyzing trace with hash 2086631939, now seen corresponding path program 2 times [2021-06-05 08:54:02,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:54:02,516 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446135564] [2021-06-05 08:54:02,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:54:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:54:02,741 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:54:02,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446135564] [2021-06-05 08:54:02,741 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446135564] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:02,741 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528653836] [2021-06-05 08:54:02,741 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 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:54:02,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:54:02,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:54:02,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 51 conjunts are in the unsatisfiable core [2021-06-05 08:54:02,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:54:02,852 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:54:02,853 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:02,856 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:02,857 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:02,857 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:54:02,900 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:54:02,900 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:54:02,902 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:02,906 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:02,907 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:02,907 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-06-05 08:54:02,952 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:54:02,952 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:02,958 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:02,959 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:02,959 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 08:54:03,022 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:54:03,024 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:03,031 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:03,038 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:54:03,038 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2021-06-05 08:54:03,132 INFO L354 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2021-06-05 08:54:03,133 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 43 treesize of output 25 [2021-06-05 08:54:03,135 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:03,148 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:54:03,148 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:54:03,150 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:03,163 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:03,166 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 08:54:03,167 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:47 [2021-06-05 08:54:03,309 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:54:03,310 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:03,311 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:03,312 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:54:03,312 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:54:03,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:54:03,328 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528653836] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:03,328 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:54:03,328 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 25 [2021-06-05 08:54:03,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164303132] [2021-06-05 08:54:03,329 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 08:54:03,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:54:03,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 08:54:03,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:54:03,330 INFO L87 Difference]: Start difference. First operand 655 states and 1235 transitions. Second operand has 25 states, 25 states have (on average 3.48) internal successors, (87), 25 states have internal predecessors, (87), 0 states have call successors, (0), 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:54:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:54:03,991 INFO L93 Difference]: Finished difference Result 1043 states and 1941 transitions. [2021-06-05 08:54:03,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 08:54:03,992 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 25 states have internal predecessors, (87), 0 states have call successors, (0), 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 61 [2021-06-05 08:54:03,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:54:03,995 INFO L225 Difference]: With dead ends: 1043 [2021-06-05 08:54:03,995 INFO L226 Difference]: Without dead ends: 1043 [2021-06-05 08:54:03,995 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 578.7ms TimeCoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 08:54:03,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2021-06-05 08:54:04,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 725. [2021-06-05 08:54:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.8812154696132597) internal successors, (1362), 724 states have internal predecessors, (1362), 0 states have call successors, (0), 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:54:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1362 transitions. [2021-06-05 08:54:04,007 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1362 transitions. Word has length 61 [2021-06-05 08:54:04,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:54:04,007 INFO L482 AbstractCegarLoop]: Abstraction has 725 states and 1362 transitions. [2021-06-05 08:54:04,007 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 25 states have internal predecessors, (87), 0 states have call successors, (0), 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:54:04,007 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1362 transitions. [2021-06-05 08:54:04,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 08:54:04,009 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:54:04,009 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 08:54:04,227 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:54:04,227 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:54:04,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:54:04,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1729446780, now seen corresponding path program 1 times [2021-06-05 08:54:04,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:54:04,227 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632796595] [2021-06-05 08:54:04,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:54:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:04,290 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:54:04,290 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:54:04,290 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632796595] [2021-06-05 08:54:04,290 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632796595] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:54:04,290 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:54:04,290 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-05 08:54:04,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073984015] [2021-06-05 08:54:04,291 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 08:54:04,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:54:04,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 08:54:04,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-06-05 08:54:04,291 INFO L87 Difference]: Start difference. First operand 725 states and 1362 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 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:54:04,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:54:04,416 INFO L93 Difference]: Finished difference Result 757 states and 1366 transitions. [2021-06-05 08:54:04,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 08:54:04,416 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 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:54:04,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:54:04,419 INFO L225 Difference]: With dead ends: 757 [2021-06-05 08:54:04,419 INFO L226 Difference]: Without dead ends: 757 [2021-06-05 08:54:04,419 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 56.1ms TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-06-05 08:54:04,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2021-06-05 08:54:04,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 669. [2021-06-05 08:54:04,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 668 states have (on average 1.847305389221557) internal successors, (1234), 668 states have internal predecessors, (1234), 0 states have call successors, (0), 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:54:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1234 transitions. [2021-06-05 08:54:04,430 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1234 transitions. Word has length 74 [2021-06-05 08:54:04,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:54:04,431 INFO L482 AbstractCegarLoop]: Abstraction has 669 states and 1234 transitions. [2021-06-05 08:54:04,431 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 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:54:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1234 transitions. [2021-06-05 08:54:04,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-05 08:54:04,432 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:54:04,432 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 08:54:04,432 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-05 08:54:04,433 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:54:04,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:54:04,433 INFO L82 PathProgramCache]: Analyzing trace with hash 926907936, now seen corresponding path program 2 times [2021-06-05 08:54:04,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:54:04,433 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610238147] [2021-06-05 08:54:04,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:54:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:54:04,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:54:04,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610238147] [2021-06-05 08:54:04,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610238147] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:04,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773427126] [2021-06-05 08:54:04,583 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 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:54:04,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 08:54:04,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:54:04,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 70 conjunts are in the unsatisfiable core [2021-06-05 08:54:04,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:54:04,678 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:54:04,679 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:04,682 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:04,682 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:04,682 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:54:04,710 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-06-05 08:54:04,710 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:54:04,711 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:04,716 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:04,717 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:04,717 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2021-06-05 08:54:04,788 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 08:54:04,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 08:54:04,792 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:04,802 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:04,803 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:04,803 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:33 [2021-06-05 08:54:04,859 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-06-05 08:54:04,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:54:04,862 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:04,871 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:04,872 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:04,872 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:33 [2021-06-05 08:54:04,902 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 11 treesize of output 7 [2021-06-05 08:54:04,903 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:04,913 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:04,914 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:04,914 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2021-06-05 08:54:04,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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:54:04,985 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:05,026 INFO L354 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2021-06-05 08:54:05,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2021-06-05 08:54:05,029 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:05,110 INFO L628 ElimStorePlain]: treesize reduction 4, result has 96.4 percent of original size [2021-06-05 08:54:05,116 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:54:05,116 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:78 [2021-06-05 08:54:05,221 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 08:54:05,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-06-05 08:54:05,223 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:05,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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:54:05,232 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:05,265 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:05,268 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:54:05,268 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:100, output treesize:62 [2021-06-05 08:54:05,494 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-06-05 08:54:05,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2021-06-05 08:54:05,496 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:05,510 INFO L354 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2021-06-05 08:54:05,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 32 [2021-06-05 08:54:05,511 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:05,533 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:05,536 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:54:05,536 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:105, output treesize:74 [2021-06-05 08:54:06,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2021-06-05 08:54:06,572 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:06,576 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:06,577 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:54:06,577 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:3 [2021-06-05 08:54:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:54:06,596 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773427126] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:06,596 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:54:06,596 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 28 [2021-06-05 08:54:06,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146540925] [2021-06-05 08:54:06,596 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 08:54:06,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:54:06,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 08:54:06,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=673, Unknown=1, NotChecked=0, Total=756 [2021-06-05 08:54:06,597 INFO L87 Difference]: Start difference. First operand 669 states and 1234 transitions. Second operand has 28 states, 28 states have (on average 4.678571428571429) internal successors, (131), 28 states have internal predecessors, (131), 0 states have call successors, (0), 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:54:10,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:54:10,359 INFO L93 Difference]: Finished difference Result 747 states and 1356 transitions. [2021-06-05 08:54:10,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 08:54:10,359 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.678571428571429) internal successors, (131), 28 states have internal predecessors, (131), 0 states have call successors, (0), 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:54:10,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:54:10,361 INFO L225 Difference]: With dead ends: 747 [2021-06-05 08:54:10,361 INFO L226 Difference]: Without dead ends: 747 [2021-06-05 08:54:10,362 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 2780.2ms TimeCoverageRelationStatistics Valid=296, Invalid=1958, Unknown=2, NotChecked=0, Total=2256 [2021-06-05 08:54:10,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2021-06-05 08:54:10,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 671. [2021-06-05 08:54:10,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 670 states have (on average 1.846268656716418) internal successors, (1237), 670 states have internal predecessors, (1237), 0 states have call successors, (0), 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:54:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1237 transitions. [2021-06-05 08:54:10,370 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 1237 transitions. Word has length 74 [2021-06-05 08:54:10,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:54:10,371 INFO L482 AbstractCegarLoop]: Abstraction has 671 states and 1237 transitions. [2021-06-05 08:54:10,371 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 4.678571428571429) internal successors, (131), 28 states have internal predecessors, (131), 0 states have call successors, (0), 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:54:10,371 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1237 transitions. [2021-06-05 08:54:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-06-05 08:54:10,372 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:54:10,372 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, 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] [2021-06-05 08:54:10,588 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-06-05 08:54:10,588 INFO L430 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:54:10,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:54:10,588 INFO L82 PathProgramCache]: Analyzing trace with hash 404794188, now seen corresponding path program 1 times [2021-06-05 08:54:10,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:54:10,589 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738094369] [2021-06-05 08:54:10,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:54:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:54:10,751 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:54:10,751 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738094369] [2021-06-05 08:54:10,751 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738094369] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:10,751 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708943568] [2021-06-05 08:54:10,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:54:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:10,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 50 conjunts are in the unsatisfiable core [2021-06-05 08:54:10,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:54:10,949 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:54:10,950 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:10,954 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:10,955 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:10,955 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2021-06-05 08:54:11,046 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:54:11,047 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:54:11,048 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:11,067 INFO L354 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2021-06-05 08:54:11,068 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 43 treesize of output 33 [2021-06-05 08:54:11,069 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:11,083 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:11,085 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:54:11,085 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:40 [2021-06-05 08:54:11,219 INFO L446 ElimStorePlain]: Different costs {0=[|#memory_int|], 1=[v_prenex_6]} [2021-06-05 08:54:11,221 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:54:11,221 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:11,226 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:11,231 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:54:11,231 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:54:11,232 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:11,236 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:11,237 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:54:11,237 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:7 [2021-06-05 08:54:11,254 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 08:54:11,254 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708943568] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:11,254 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:54:11,254 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 24 [2021-06-05 08:54:11,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304511054] [2021-06-05 08:54:11,254 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 08:54:11,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:54:11,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 08:54:11,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=478, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:54:11,255 INFO L87 Difference]: Start difference. First operand 671 states and 1237 transitions. Second operand has 24 states, 24 states have (on average 6.208333333333333) internal successors, (149), 24 states have internal predecessors, (149), 0 states have call successors, (0), 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:54:12,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:54:12,861 INFO L93 Difference]: Finished difference Result 1403 states and 2559 transitions. [2021-06-05 08:54:12,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2021-06-05 08:54:12,873 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 6.208333333333333) internal successors, (149), 24 states have internal predecessors, (149), 0 states have call successors, (0), 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 89 [2021-06-05 08:54:12,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:54:12,876 INFO L225 Difference]: With dead ends: 1403 [2021-06-05 08:54:12,876 INFO L226 Difference]: Without dead ends: 1403 [2021-06-05 08:54:12,878 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1794 ImplicationChecksByTransitivity, 1263.9ms TimeCoverageRelationStatistics Valid=692, Invalid=5160, Unknown=0, NotChecked=0, Total=5852 [2021-06-05 08:54:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2021-06-05 08:54:12,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 939. [2021-06-05 08:54:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 938 states have (on average 1.8550106609808101) internal successors, (1740), 938 states have internal predecessors, (1740), 0 states have call successors, (0), 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:54:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1740 transitions. [2021-06-05 08:54:12,908 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1740 transitions. Word has length 89 [2021-06-05 08:54:12,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:54:12,908 INFO L482 AbstractCegarLoop]: Abstraction has 939 states and 1740 transitions. [2021-06-05 08:54:12,908 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 6.208333333333333) internal successors, (149), 24 states have internal predecessors, (149), 0 states have call successors, (0), 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:54:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1740 transitions. [2021-06-05 08:54:12,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 08:54:12,913 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:54:12,913 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, 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] [2021-06-05 08:54:13,129 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:54:13,129 INFO L430 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:54:13,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:54:13,130 INFO L82 PathProgramCache]: Analyzing trace with hash -560396740, now seen corresponding path program 1 times [2021-06-05 08:54:13,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:54:13,130 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587837594] [2021-06-05 08:54:13,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:54:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:54:13,312 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:54:13,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587837594] [2021-06-05 08:54:13,312 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587837594] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:13,312 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698067289] [2021-06-05 08:54:13,312 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:54:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:13,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 58 conjunts are in the unsatisfiable core [2021-06-05 08:54:13,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:54:13,422 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:54:13,425 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:13,428 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:13,429 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:13,429 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:54:13,444 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:54:13,444 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:54:13,445 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:13,449 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:13,449 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:13,449 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 08:54:13,582 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:54:13,583 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:13,589 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:13,589 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:13,589 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 08:54:13,694 INFO L354 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2021-06-05 08:54:13,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 33 [2021-06-05 08:54:13,696 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:13,706 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:54:13,706 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:54:13,707 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:13,729 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:13,730 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:54:13,731 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:83, output treesize:48 [2021-06-05 08:54:13,901 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:54:13,903 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:13,918 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 08:54:13,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 08:54:13,919 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:13,934 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:13,943 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:54:13,943 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:23 [2021-06-05 08:54:13,971 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:54:13,972 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:13,976 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:13,977 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:54:13,978 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:13,980 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:13,981 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:54:13,981 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2021-06-05 08:54:13,997 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:54:13,997 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698067289] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:13,997 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:54:13,997 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 27 [2021-06-05 08:54:13,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356090428] [2021-06-05 08:54:13,998 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 08:54:13,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:54:13,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 08:54:13,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2021-06-05 08:54:13,999 INFO L87 Difference]: Start difference. First operand 939 states and 1740 transitions. Second operand has 27 states, 27 states have (on average 5.666666666666667) internal successors, (153), 27 states have internal predecessors, (153), 0 states have call successors, (0), 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:54:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:54:16,172 INFO L93 Difference]: Finished difference Result 1609 states and 2878 transitions. [2021-06-05 08:54:16,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2021-06-05 08:54:16,173 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.666666666666667) internal successors, (153), 27 states have internal predecessors, (153), 0 states have call successors, (0), 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 95 [2021-06-05 08:54:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:54:16,177 INFO L225 Difference]: With dead ends: 1609 [2021-06-05 08:54:16,177 INFO L226 Difference]: Without dead ends: 1609 [2021-06-05 08:54:16,178 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2772 ImplicationChecksByTransitivity, 1782.3ms TimeCoverageRelationStatistics Valid=905, Invalid=7467, Unknown=0, NotChecked=0, Total=8372 [2021-06-05 08:54:16,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2021-06-05 08:54:16,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 947. [2021-06-05 08:54:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 946 states have (on average 1.854122621564482) internal successors, (1754), 946 states have internal predecessors, (1754), 0 states have call successors, (0), 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:54:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1754 transitions. [2021-06-05 08:54:16,193 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1754 transitions. Word has length 95 [2021-06-05 08:54:16,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:54:16,193 INFO L482 AbstractCegarLoop]: Abstraction has 947 states and 1754 transitions. [2021-06-05 08:54:16,193 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 5.666666666666667) internal successors, (153), 27 states have internal predecessors, (153), 0 states have call successors, (0), 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:54:16,193 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1754 transitions. [2021-06-05 08:54:16,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-06-05 08:54:16,194 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:54:16,194 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, 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] [2021-06-05 08:54:16,409 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-06-05 08:54:16,409 INFO L430 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:54:16,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:54:16,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1679370156, now seen corresponding path program 2 times [2021-06-05 08:54:16,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:54:16,409 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323318619] [2021-06-05 08:54:16,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:54:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:54:16,702 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:54:16,702 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323318619] [2021-06-05 08:54:16,702 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323318619] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:16,702 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052775104] [2021-06-05 08:54:16,702 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 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:54:16,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 08:54:16,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:54:16,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 67 conjunts are in the unsatisfiable core [2021-06-05 08:54:16,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:54:16,816 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:54:16,817 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:16,821 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:16,821 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:16,821 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:54:16,858 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:54:16,858 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:54:16,860 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:16,865 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:16,866 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:16,866 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2021-06-05 08:54:16,906 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:54:16,907 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:54:16,908 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:16,917 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:16,918 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:16,918 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:34 [2021-06-05 08:54:17,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2021-06-05 08:54:17,004 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:17,018 INFO L628 ElimStorePlain]: treesize reduction 8, result has 76.5 percent of original size [2021-06-05 08:54:17,020 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:54:17,020 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:26 [2021-06-05 08:54:17,087 INFO L354 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2021-06-05 08:54:17,087 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 3 case distinctions, treesize of input 22 treesize of output 29 [2021-06-05 08:54:17,089 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:17,102 INFO L628 ElimStorePlain]: treesize reduction 4, result has 86.7 percent of original size [2021-06-05 08:54:17,106 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:54:17,106 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:26 [2021-06-05 08:54:17,212 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:17,233 INFO L354 Elim1Store]: treesize reduction 28, result has 31.7 percent of original size [2021-06-05 08:54:17,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 08:54:17,236 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:17,243 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:17,244 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:54:17,245 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:14 [2021-06-05 08:54:17,291 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:54:17,291 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:17,297 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:17,297 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:17,297 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 08:54:17,372 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:54:17,373 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:17,379 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:17,383 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:54:17,384 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2021-06-05 08:54:17,475 INFO L354 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2021-06-05 08:54:17,475 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 43 treesize of output 33 [2021-06-05 08:54:17,476 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:17,488 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:54:17,488 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:54:17,489 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:17,506 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:17,507 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:54:17,508 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:40 [2021-06-05 08:54:17,682 INFO L446 ElimStorePlain]: Different costs {0=[|#memory_int|], 1=[v_prenex_12]} [2021-06-05 08:54:17,684 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:54:17,685 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:17,691 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:17,696 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:54:17,696 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:54:17,698 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:17,703 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:17,704 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:54:17,704 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:7 [2021-06-05 08:54:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:54:17,728 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052775104] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:17,728 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:54:17,728 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 37 [2021-06-05 08:54:17,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565059583] [2021-06-05 08:54:17,729 INFO L462 AbstractCegarLoop]: Interpolant automaton has 37 states [2021-06-05 08:54:17,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:54:17,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-06-05 08:54:17,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1188, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 08:54:17,730 INFO L87 Difference]: Start difference. First operand 947 states and 1754 transitions. Second operand has 37 states, 37 states have (on average 4.1891891891891895) internal successors, (155), 37 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:54:20,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:54:20,129 INFO L93 Difference]: Finished difference Result 1575 states and 2827 transitions. [2021-06-05 08:54:20,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2021-06-05 08:54:20,130 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.1891891891891895) internal successors, (155), 37 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 95 [2021-06-05 08:54:20,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:54:20,134 INFO L225 Difference]: With dead ends: 1575 [2021-06-05 08:54:20,134 INFO L226 Difference]: Without dead ends: 1575 [2021-06-05 08:54:20,135 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2794 ImplicationChecksByTransitivity, 2194.7ms TimeCoverageRelationStatistics Valid=966, Invalid=7590, Unknown=0, NotChecked=0, Total=8556 [2021-06-05 08:54:20,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2021-06-05 08:54:20,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 955. [2021-06-05 08:54:20,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 954 states have (on average 1.849056603773585) internal successors, (1764), 954 states have internal predecessors, (1764), 0 states have call successors, (0), 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:54:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1764 transitions. [2021-06-05 08:54:20,162 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1764 transitions. Word has length 95 [2021-06-05 08:54:20,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:54:20,163 INFO L482 AbstractCegarLoop]: Abstraction has 955 states and 1764 transitions. [2021-06-05 08:54:20,163 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 37 states, 37 states have (on average 4.1891891891891895) internal successors, (155), 37 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:54:20,163 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1764 transitions. [2021-06-05 08:54:20,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-06-05 08:54:20,164 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:54:20,164 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2021-06-05 08:54:20,371 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:54:20,371 INFO L430 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:54:20,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:54:20,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1624312599, now seen corresponding path program 1 times [2021-06-05 08:54:20,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:54:20,371 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713616123] [2021-06-05 08:54:20,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:54:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:54:20,758 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:54:20,758 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713616123] [2021-06-05 08:54:20,758 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713616123] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:20,758 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868457977] [2021-06-05 08:54:20,758 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:54:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:20,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 98 conjunts are in the unsatisfiable core [2021-06-05 08:54:20,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:54:20,875 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:54:20,876 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:20,879 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:20,880 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:20,880 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:54:20,895 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:54:20,895 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:54:20,896 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:20,899 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:20,900 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:20,900 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 08:54:20,979 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:54:20,980 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:20,985 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:20,985 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:20,986 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2021-06-05 08:54:21,013 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:54:21,013 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:54:21,014 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:21,020 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:21,021 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:21,021 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2021-06-05 08:54:21,051 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:54:21,051 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:21,058 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:21,058 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:21,058 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2021-06-05 08:54:21,218 INFO L354 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2021-06-05 08:54:21,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 29 [2021-06-05 08:54:21,219 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:21,240 INFO L628 ElimStorePlain]: treesize reduction 4, result has 90.7 percent of original size [2021-06-05 08:54:21,240 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:21,241 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:39 [2021-06-05 08:54:21,352 INFO L354 Elim1Store]: treesize reduction 52, result has 40.2 percent of original size [2021-06-05 08:54:21,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 33 treesize of output 58 [2021-06-05 08:54:21,365 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:21,385 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 08:54:21,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 08:54:21,386 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:21,419 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:21,428 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:54:21,428 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:89, output treesize:95 [2021-06-05 08:54:21,718 INFO L354 Elim1Store]: treesize reduction 74, result has 16.9 percent of original size [2021-06-05 08:54:21,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 31 [2021-06-05 08:54:21,720 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:21,743 INFO L354 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2021-06-05 08:54:21,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 31 [2021-06-05 08:54:21,745 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:21,767 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:21,768 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:54:21,769 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:103, output treesize:61 [2021-06-05 08:54:22,039 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 08:54:22,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 21 [2021-06-05 08:54:22,040 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:22,044 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:22,044 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:54:22,045 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2021-06-05 08:54:22,065 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:54:22,065 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868457977] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:22,065 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:54:22,065 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 40 [2021-06-05 08:54:22,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644605121] [2021-06-05 08:54:22,066 INFO L462 AbstractCegarLoop]: Interpolant automaton has 40 states [2021-06-05 08:54:22,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:54:22,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-06-05 08:54:22,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1408, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 08:54:22,067 INFO L87 Difference]: Start difference. First operand 955 states and 1764 transitions. Second operand has 40 states, 40 states have (on average 4.475) internal successors, (179), 40 states have internal predecessors, (179), 0 states have call successors, (0), 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:54:26,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:54:26,175 INFO L93 Difference]: Finished difference Result 1481 states and 2655 transitions. [2021-06-05 08:54:26,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2021-06-05 08:54:26,176 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 4.475) internal successors, (179), 40 states have internal predecessors, (179), 0 states have call successors, (0), 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 108 [2021-06-05 08:54:26,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:54:26,179 INFO L225 Difference]: With dead ends: 1481 [2021-06-05 08:54:26,179 INFO L226 Difference]: Without dead ends: 1481 [2021-06-05 08:54:26,182 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5496 ImplicationChecksByTransitivity, 4019.2ms TimeCoverageRelationStatistics Valid=1749, Invalid=13751, Unknown=0, NotChecked=0, Total=15500 [2021-06-05 08:54:26,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2021-06-05 08:54:26,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 963. [2021-06-05 08:54:26,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.8482328482328483) internal successors, (1778), 962 states have internal predecessors, (1778), 0 states have call successors, (0), 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:54:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1778 transitions. [2021-06-05 08:54:26,196 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1778 transitions. Word has length 108 [2021-06-05 08:54:26,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:54:26,196 INFO L482 AbstractCegarLoop]: Abstraction has 963 states and 1778 transitions. [2021-06-05 08:54:26,196 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 40 states, 40 states have (on average 4.475) internal successors, (179), 40 states have internal predecessors, (179), 0 states have call successors, (0), 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:54:26,196 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1778 transitions. [2021-06-05 08:54:26,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-06-05 08:54:26,197 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:54:26,197 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2021-06-05 08:54:26,409 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:54:26,409 INFO L430 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:54:26,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:54:26,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1266240539, now seen corresponding path program 2 times [2021-06-05 08:54:26,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:54:26,410 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42934086] [2021-06-05 08:54:26,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:54:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 37 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 08:54:26,505 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:54:26,505 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42934086] [2021-06-05 08:54:26,505 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42934086] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:26,505 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561003486] [2021-06-05 08:54:26,506 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 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:54:26,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 08:54:26,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:54:26,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 61 conjunts are in the unsatisfiable core [2021-06-05 08:54:26,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:54:26,621 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:54:26,622 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:26,624 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:26,625 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:26,625 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:54:26,644 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:54:26,644 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:54:26,645 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:26,647 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:26,648 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:26,648 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2021-06-05 08:54:26,778 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:54:26,779 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:26,785 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:26,787 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:54:26,787 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 08:54:26,822 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:54:26,823 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:54:26,824 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:26,831 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:26,832 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:54:26,833 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:14 [2021-06-05 08:54:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-06-05 08:54:26,886 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561003486] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:26,886 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:54:26,887 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2021-06-05 08:54:26,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554861706] [2021-06-05 08:54:26,887 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 08:54:26,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:54:26,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 08:54:26,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2021-06-05 08:54:26,888 INFO L87 Difference]: Start difference. First operand 963 states and 1778 transitions. Second operand has 21 states, 21 states have (on average 8.047619047619047) internal successors, (169), 21 states have internal predecessors, (169), 0 states have call successors, (0), 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:54:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:54:27,324 INFO L93 Difference]: Finished difference Result 1043 states and 1894 transitions. [2021-06-05 08:54:27,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 08:54:27,324 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.047619047619047) internal successors, (169), 21 states have internal predecessors, (169), 0 states have call successors, (0), 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 108 [2021-06-05 08:54:27,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:54:27,326 INFO L225 Difference]: With dead ends: 1043 [2021-06-05 08:54:27,327 INFO L226 Difference]: Without dead ends: 1043 [2021-06-05 08:54:27,327 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 432.1ms TimeCoverageRelationStatistics Valid=275, Invalid=1365, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 08:54:27,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2021-06-05 08:54:27,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 907. [2021-06-05 08:54:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 906 states have (on average 1.8653421633554084) internal successors, (1690), 906 states have internal predecessors, (1690), 0 states have call successors, (0), 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:54:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1690 transitions. [2021-06-05 08:54:27,338 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1690 transitions. Word has length 108 [2021-06-05 08:54:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:54:27,338 INFO L482 AbstractCegarLoop]: Abstraction has 907 states and 1690 transitions. [2021-06-05 08:54:27,338 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 8.047619047619047) internal successors, (169), 21 states have internal predecessors, (169), 0 states have call successors, (0), 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:54:27,339 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1690 transitions. [2021-06-05 08:54:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-06-05 08:54:27,340 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:54:27,340 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-06-05 08:54:27,556 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2021-06-05 08:54:27,556 INFO L430 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:54:27,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:54:27,557 INFO L82 PathProgramCache]: Analyzing trace with hash 577400168, now seen corresponding path program 1 times [2021-06-05 08:54:27,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:54:27,557 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970195661] [2021-06-05 08:54:27,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:54:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2021-06-05 08:54:27,582 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:54:27,582 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970195661] [2021-06-05 08:54:27,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970195661] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:54:27,582 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:54:27,582 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 08:54:27,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129998427] [2021-06-05 08:54:27,583 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 08:54:27,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:54:27,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 08:54:27,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:54:27,584 INFO L87 Difference]: Start difference. First operand 907 states and 1690 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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:54:27,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:54:27,591 INFO L93 Difference]: Finished difference Result 699 states and 1293 transitions. [2021-06-05 08:54:27,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 08:54:27,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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 127 [2021-06-05 08:54:27,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:54:27,592 INFO L225 Difference]: With dead ends: 699 [2021-06-05 08:54:27,592 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 08:54:27,592 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 08:54:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 08:54:27,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 08:54:27,592 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:54:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 08:54:27,592 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 127 [2021-06-05 08:54:27,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:54:27,592 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 08:54:27,592 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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:54:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 08:54:27,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 08:54:27,593 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-06-05 08:54:27,593 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 08:54:27,595 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 08:54:27,595 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:54:27,595 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:54:27,595 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:54:27,595 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:54:27,595 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:54:27,596 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:54:27,596 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:54:27,596 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 08:54:27,598 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 88 transitions, 181 flow [2021-06-05 08:54:27,605 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 713 states, 708 states have (on average 2.110169491525424) internal successors, (1494), 712 states have internal predecessors, (1494), 0 states have call successors, (0), 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:54:27,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 713 states, 708 states have (on average 2.110169491525424) internal successors, (1494), 712 states have internal predecessors, (1494), 0 states have call successors, (0), 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:54:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-06-05 08:54:27,606 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:54:27,606 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] [2021-06-05 08:54:27,606 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 08:54:27,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:54:27,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1382606666, now seen corresponding path program 1 times [2021-06-05 08:54:27,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:54:27,607 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407033704] [2021-06-05 08:54:27,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:54:27,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 08:54:27,612 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 08:54:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 08:54:27,616 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 08:54:27,629 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 08:54:27,630 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 08:54:27,630 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-06-05 08:54:27,630 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 08:54:27,630 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 08:54:27,630 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 08:54:27,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,645 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,645 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,646 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,646 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,647 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,647 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,648 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,648 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,649 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,649 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,650 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:54:27,650 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:54:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,650 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,651 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:54:27,651 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:54:27,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,651 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,651 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,651 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:54:27,651 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:54:27,651 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:54:27,651 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:54:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,652 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:54:27,652 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:54:27,652 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:54:27,652 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:54:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,652 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,653 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,653 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,654 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,654 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,655 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,656 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:54:27,656 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:54:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,656 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:54:27,656 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:54:27,656 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:54:27,656 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:54:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,656 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:54:27,656 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:54:27,656 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:54:27,656 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:54:27,656 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:54:27,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,656 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,656 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,656 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:54:27,657 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:54:27,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,657 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:54:27,657 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:54:27,657 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:54:27,657 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:54:27,657 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,657 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:54:27,657 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:54:27,657 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:54:27,657 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:54:27,657 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:54:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,657 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,658 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,659 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,659 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,660 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,660 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,663 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,663 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,664 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,664 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,665 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,666 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:54:27,666 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:54:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,666 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:54:27,666 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:54:27,666 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,666 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,667 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,667 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:54:27,667 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:54:27,667 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:54:27,667 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:54:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,667 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:54:27,667 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:54:27,667 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:54:27,667 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:54:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,667 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,668 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,669 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,670 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:54:27,670 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:54:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,670 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:54:27,670 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:54:27,670 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:54:27,670 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:54:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,670 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:54:27,670 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:54:27,670 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:54:27,670 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:54:27,670 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:54:27,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,670 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,670 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,671 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:54:27,671 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:54:27,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,671 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:54:27,671 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:54:27,671 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:54:27,671 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:54:27,671 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,671 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:54:27,671 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:54:27,671 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:54:27,671 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:54:27,671 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:54:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,671 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,672 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,673 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,673 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:54:27,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,673 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:54:27,673 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:54:27,673 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,674 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:54:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,674 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:54:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,674 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:54:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,674 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:54:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,674 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:54:27,674 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,674 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:54:27,674 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:54:27,674 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,675 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:54:27,675 WARN L313 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,675 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:54:27,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,675 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,675 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:54:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,676 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,676 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:54:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,676 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:54:27,676 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,676 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:54:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,677 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:54:27,677 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:54:27,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,677 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:54:27,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,677 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:54:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~e not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,677 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:54:27,677 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:54:27,677 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:54:27,677 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,677 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_CAS_~u not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~oldTop~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,678 WARN L313 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_push_~d not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,678 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:54:27,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,678 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:54:27,678 WARN L313 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#ret~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 08:54:27,678 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:54:27,679 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-05 08:54:27,680 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 08:54:27,680 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 08:54:27,681 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 08:54:27,681 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 08:54:27,681 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 08:54:27,681 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 08:54:27,681 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 08:54:27,681 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 08:54:27,681 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 08:54:27,685 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 137 places, 149 transitions, 310 flow [2021-06-05 08:54:29,972 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 37177 states, 37166 states have (on average 3.2457353495129957) internal successors, (120631), 37176 states have internal predecessors, (120631), 0 states have call successors, (0), 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:54:30,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 37177 states, 37166 states have (on average 3.2457353495129957) internal successors, (120631), 37176 states have internal predecessors, (120631), 0 states have call successors, (0), 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:54:30,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-06-05 08:54:30,040 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:54:30,040 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] [2021-06-05 08:54:30,040 INFO L430 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:54:30,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:54:30,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1255764858, now seen corresponding path program 1 times [2021-06-05 08:54:30,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:54:30,041 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870760386] [2021-06-05 08:54:30,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:54:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:30,052 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:54:30,052 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:54:30,052 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870760386] [2021-06-05 08:54:30,052 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870760386] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:54:30,052 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:54:30,052 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 08:54:30,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124748783] [2021-06-05 08:54:30,052 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 08:54:30,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:54:30,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 08:54:30,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 08:54:30,099 INFO L87 Difference]: Start difference. First operand has 37177 states, 37166 states have (on average 3.2457353495129957) internal successors, (120631), 37176 states have internal predecessors, (120631), 0 states have call successors, (0), 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 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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:54:30,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:54:30,305 INFO L93 Difference]: Finished difference Result 16534 states and 48678 transitions. [2021-06-05 08:54:30,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 08:54:30,306 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2021-06-05 08:54:30,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:54:30,363 INFO L225 Difference]: With dead ends: 16534 [2021-06-05 08:54:30,363 INFO L226 Difference]: Without dead ends: 16526 [2021-06-05 08:54:30,363 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:54:30,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16526 states. [2021-06-05 08:54:30,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16526 to 16526. [2021-06-05 08:54:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16526 states, 16523 states have (on average 2.944683168916056) internal successors, (48655), 16525 states have internal predecessors, (48655), 0 states have call successors, (0), 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:54:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16526 states to 16526 states and 48655 transitions. [2021-06-05 08:54:30,952 INFO L78 Accepts]: Start accepts. Automaton has 16526 states and 48655 transitions. Word has length 43 [2021-06-05 08:54:30,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:54:30,952 INFO L482 AbstractCegarLoop]: Abstraction has 16526 states and 48655 transitions. [2021-06-05 08:54:30,952 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 0 states have call successors, (0), 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:54:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand 16526 states and 48655 transitions. [2021-06-05 08:54:30,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-05 08:54:30,962 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:54:30,962 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] [2021-06-05 08:54:30,962 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-06-05 08:54:30,962 INFO L430 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:54:30,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:54:30,962 INFO L82 PathProgramCache]: Analyzing trace with hash 300454086, now seen corresponding path program 1 times [2021-06-05 08:54:30,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:54:30,962 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287803427] [2021-06-05 08:54:30,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:54:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:31,061 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:54:31,061 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:54:31,061 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287803427] [2021-06-05 08:54:31,061 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287803427] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:54:31,062 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:54:31,062 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 08:54:31,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200707393] [2021-06-05 08:54:31,062 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 08:54:31,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:54:31,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 08:54:31,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 08:54:31,062 INFO L87 Difference]: Start difference. First operand 16526 states and 48655 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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:54:31,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:54:31,640 INFO L93 Difference]: Finished difference Result 21059 states and 61463 transitions. [2021-06-05 08:54:31,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 08:54:31,640 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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:54:31,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:54:31,680 INFO L225 Difference]: With dead ends: 21059 [2021-06-05 08:54:31,680 INFO L226 Difference]: Without dead ends: 21059 [2021-06-05 08:54:31,681 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 266.3ms TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:54:31,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21059 states. [2021-06-05 08:54:32,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21059 to 19564. [2021-06-05 08:54:32,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19564 states, 19561 states have (on average 2.9280711620060322) internal successors, (57276), 19563 states have internal predecessors, (57276), 0 states have call successors, (0), 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:54:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19564 states to 19564 states and 57276 transitions. [2021-06-05 08:54:32,216 INFO L78 Accepts]: Start accepts. Automaton has 19564 states and 57276 transitions. Word has length 55 [2021-06-05 08:54:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:54:32,216 INFO L482 AbstractCegarLoop]: Abstraction has 19564 states and 57276 transitions. [2021-06-05 08:54:32,216 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 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:54:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 19564 states and 57276 transitions. [2021-06-05 08:54:32,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 08:54:32,231 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:54:32,232 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] [2021-06-05 08:54:32,232 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-06-05 08:54:32,232 INFO L430 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:54:32,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:54:32,232 INFO L82 PathProgramCache]: Analyzing trace with hash 381087412, now seen corresponding path program 1 times [2021-06-05 08:54:32,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:54:32,232 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301502008] [2021-06-05 08:54:32,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:54:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:54:32,369 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:54:32,370 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301502008] [2021-06-05 08:54:32,370 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301502008] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:32,370 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350021728] [2021-06-05 08:54:32,370 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:54:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:32,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 51 conjunts are in the unsatisfiable core [2021-06-05 08:54:32,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:54:32,457 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:54:32,458 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:32,461 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:32,461 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:32,461 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:54:32,490 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:54:32,491 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:54:32,492 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:32,496 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:32,497 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:32,497 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-06-05 08:54:32,533 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:54:32,534 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:32,539 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:32,540 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:32,540 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 08:54:32,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, 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:54:32,637 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:32,643 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:32,644 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:54:32,644 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2021-06-05 08:54:32,715 INFO L354 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2021-06-05 08:54:32,715 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 43 treesize of output 25 [2021-06-05 08:54:32,716 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:32,732 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:54:32,732 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:54:32,733 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:32,748 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:32,750 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 08:54:32,750 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:47 [2021-06-05 08:54:32,874 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:54:32,874 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:32,876 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:32,876 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:54:32,876 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:54:32,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:54:32,893 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350021728] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:32,893 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:54:32,893 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 25 [2021-06-05 08:54:32,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390846412] [2021-06-05 08:54:32,894 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 08:54:32,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:54:32,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 08:54:32,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:54:32,894 INFO L87 Difference]: Start difference. First operand 19564 states and 57276 transitions. Second operand has 25 states, 25 states have (on average 3.48) internal successors, (87), 25 states have internal predecessors, (87), 0 states have call successors, (0), 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:54:34,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:54:34,519 INFO L93 Difference]: Finished difference Result 28400 states and 82858 transitions. [2021-06-05 08:54:34,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 08:54:34,520 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 25 states have internal predecessors, (87), 0 states have call successors, (0), 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 61 [2021-06-05 08:54:34,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:54:34,579 INFO L225 Difference]: With dead ends: 28400 [2021-06-05 08:54:34,579 INFO L226 Difference]: Without dead ends: 28400 [2021-06-05 08:54:34,580 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1011.7ms TimeCoverageRelationStatistics Valid=278, Invalid=1702, Unknown=0, NotChecked=0, Total=1980 [2021-06-05 08:54:34,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28400 states. [2021-06-05 08:54:35,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28400 to 20513. [2021-06-05 08:54:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20513 states, 20510 states have (on average 2.9321794246708923) internal successors, (60139), 20512 states have internal predecessors, (60139), 0 states have call successors, (0), 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:54:35,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20513 states to 20513 states and 60139 transitions. [2021-06-05 08:54:35,107 INFO L78 Accepts]: Start accepts. Automaton has 20513 states and 60139 transitions. Word has length 61 [2021-06-05 08:54:35,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:54:35,107 INFO L482 AbstractCegarLoop]: Abstraction has 20513 states and 60139 transitions. [2021-06-05 08:54:35,107 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 25 states have internal predecessors, (87), 0 states have call successors, (0), 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:54:35,107 INFO L276 IsEmpty]: Start isEmpty. Operand 20513 states and 60139 transitions. [2021-06-05 08:54:35,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 08:54:35,122 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:54:35,122 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] [2021-06-05 08:54:35,337 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:54:35,337 INFO L430 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:54:35,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:54:35,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1684782062, now seen corresponding path program 2 times [2021-06-05 08:54:35,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:54:35,338 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269454518] [2021-06-05 08:54:35,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:54:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:54:35,660 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:54:35,660 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269454518] [2021-06-05 08:54:35,660 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269454518] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:35,660 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135661695] [2021-06-05 08:54:35,660 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 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:54:35,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:54:35,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:54:35,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 54 conjunts are in the unsatisfiable core [2021-06-05 08:54:35,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:54:35,738 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:54:35,739 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:35,742 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:35,743 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:35,743 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:54:35,766 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:54:35,767 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:54:35,768 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:35,771 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:35,771 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:35,771 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 08:54:35,837 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:54:35,838 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:35,843 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:35,844 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:35,844 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 08:54:35,965 INFO L354 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2021-06-05 08:54:35,966 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 2 case distinctions, treesize of input 43 treesize of output 25 [2021-06-05 08:54:35,967 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:35,973 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:35,974 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:54:35,975 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:29 [2021-06-05 08:54:36,014 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:54:36,015 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:36,020 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:36,021 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:54:36,021 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2021-06-05 08:54:36,052 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:54:36,053 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:36,054 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:36,054 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:54:36,054 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:54:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:54:36,070 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135661695] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:36,070 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:54:36,070 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2021-06-05 08:54:36,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343988245] [2021-06-05 08:54:36,070 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 08:54:36,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:54:36,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 08:54:36,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:54:36,071 INFO L87 Difference]: Start difference. First operand 20513 states and 60139 transitions. Second operand has 25 states, 25 states have (on average 4.04) internal successors, (101), 25 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:54:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:54:37,838 INFO L93 Difference]: Finished difference Result 33211 states and 96882 transitions. [2021-06-05 08:54:37,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 08:54:37,838 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 25 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 61 [2021-06-05 08:54:37,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:54:37,971 INFO L225 Difference]: With dead ends: 33211 [2021-06-05 08:54:37,971 INFO L226 Difference]: Without dead ends: 33211 [2021-06-05 08:54:37,973 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 1126.3ms TimeCoverageRelationStatistics Valid=274, Invalid=1706, Unknown=0, NotChecked=0, Total=1980 [2021-06-05 08:54:38,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33211 states. [2021-06-05 08:54:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33211 to 22199. [2021-06-05 08:54:38,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22199 states, 22196 states have (on average 2.9385024328707874) internal successors, (65223), 22198 states have internal predecessors, (65223), 0 states have call successors, (0), 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:54:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22199 states to 22199 states and 65223 transitions. [2021-06-05 08:54:38,716 INFO L78 Accepts]: Start accepts. Automaton has 22199 states and 65223 transitions. Word has length 61 [2021-06-05 08:54:38,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:54:38,716 INFO L482 AbstractCegarLoop]: Abstraction has 22199 states and 65223 transitions. [2021-06-05 08:54:38,716 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 25 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:54:38,716 INFO L276 IsEmpty]: Start isEmpty. Operand 22199 states and 65223 transitions. [2021-06-05 08:54:38,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 08:54:38,730 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:54:38,730 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] [2021-06-05 08:54:38,946 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:54:38,946 INFO L430 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:54:38,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:54:38,947 INFO L82 PathProgramCache]: Analyzing trace with hash 850641201, now seen corresponding path program 1 times [2021-06-05 08:54:38,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:54:38,947 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266232171] [2021-06-05 08:54:38,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:54:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:39,085 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:54:39,085 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:54:39,086 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266232171] [2021-06-05 08:54:39,086 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266232171] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:54:39,086 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:54:39,086 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 08:54:39,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132294436] [2021-06-05 08:54:39,086 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 08:54:39,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:54:39,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 08:54:39,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-06-05 08:54:39,087 INFO L87 Difference]: Start difference. First operand 22199 states and 65223 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 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:54:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:54:39,576 INFO L93 Difference]: Finished difference Result 25721 states and 75436 transitions. [2021-06-05 08:54:39,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-05 08:54:39,577 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 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 62 [2021-06-05 08:54:39,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:54:39,615 INFO L225 Difference]: With dead ends: 25721 [2021-06-05 08:54:39,615 INFO L226 Difference]: Without dead ends: 25721 [2021-06-05 08:54:39,615 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 242.4ms TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2021-06-05 08:54:39,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25721 states. [2021-06-05 08:54:39,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25721 to 24359. [2021-06-05 08:54:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24359 states, 24356 states have (on average 2.936483823287896) internal successors, (71521), 24358 states have internal predecessors, (71521), 0 states have call successors, (0), 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:54:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24359 states to 24359 states and 71521 transitions. [2021-06-05 08:54:40,067 INFO L78 Accepts]: Start accepts. Automaton has 24359 states and 71521 transitions. Word has length 62 [2021-06-05 08:54:40,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:54:40,068 INFO L482 AbstractCegarLoop]: Abstraction has 24359 states and 71521 transitions. [2021-06-05 08:54:40,068 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 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:54:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 24359 states and 71521 transitions. [2021-06-05 08:54:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 08:54:40,087 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:54:40,087 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:54:40,087 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-06-05 08:54:40,087 INFO L430 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:54:40,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:54:40,088 INFO L82 PathProgramCache]: Analyzing trace with hash 309940551, now seen corresponding path program 1 times [2021-06-05 08:54:40,088 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:54:40,088 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708956977] [2021-06-05 08:54:40,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:54:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:40,479 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:54:40,479 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:54:40,479 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708956977] [2021-06-05 08:54:40,480 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708956977] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:40,480 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216855346] [2021-06-05 08:54:40,480 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:54:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:54:40,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 63 conjunts are in the unsatisfiable core [2021-06-05 08:54:40,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:54:40,666 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:54:40,667 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:40,670 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:40,671 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:40,671 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:54:40,691 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:54:40,691 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:54:40,692 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:40,697 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:40,698 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:40,698 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2021-06-05 08:54:40,762 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:54:40,762 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:54:40,763 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:40,774 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:40,775 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:40,775 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:37 [2021-06-05 08:54:40,819 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:54:40,819 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:54:40,821 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:40,833 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:40,834 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:40,834 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:37 [2021-06-05 08:54:40,865 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 11 treesize of output 7 [2021-06-05 08:54:40,866 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:40,877 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:40,877 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:54:40,878 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2021-06-05 08:54:40,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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:54:40,951 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:40,967 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:40,968 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:54:40,968 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:44 [2021-06-05 08:54:41,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2021-06-05 08:54:41,100 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:41,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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:54:41,105 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:41,164 INFO L628 ElimStorePlain]: treesize reduction 4, result has 96.1 percent of original size [2021-06-05 08:54:41,167 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:54:41,167 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:123, output treesize:98 [2021-06-05 08:54:41,268 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 08:54:41,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-06-05 08:54:41,269 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:41,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2021-06-05 08:54:41,277 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:41,311 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:41,314 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:54:41,315 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:120, output treesize:74 [2021-06-05 08:54:42,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2021-06-05 08:54:42,084 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:54:42,088 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:54:42,091 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:54:42,091 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:3 [2021-06-05 08:54:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:54:42,114 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216855346] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:54:42,114 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:54:42,114 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 30 [2021-06-05 08:54:42,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403128836] [2021-06-05 08:54:42,114 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 08:54:42,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:54:42,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 08:54:42,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:54:42,115 INFO L87 Difference]: Start difference. First operand 24359 states and 71521 transitions. Second operand has 30 states, 30 states have (on average 3.8333333333333335) internal successors, (115), 30 states have internal predecessors, (115), 0 states have call successors, (0), 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:55:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:55:09,880 INFO L93 Difference]: Finished difference Result 54817 states and 160596 transitions. [2021-06-05 08:55:09,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-06-05 08:55:09,881 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.8333333333333335) internal successors, (115), 30 states have internal predecessors, (115), 0 states have call successors, (0), 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 68 [2021-06-05 08:55:09,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:55:09,962 INFO L225 Difference]: With dead ends: 54817 [2021-06-05 08:55:09,962 INFO L226 Difference]: Without dead ends: 54817 [2021-06-05 08:55:09,963 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 57 SyntacticMatches, 9 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2609 ImplicationChecksByTransitivity, 4544.0ms TimeCoverageRelationStatistics Valid=960, Invalid=6180, Unknown=0, NotChecked=0, Total=7140 [2021-06-05 08:55:10,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54817 states. [2021-06-05 08:55:10,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54817 to 27610. [2021-06-05 08:55:10,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27610 states, 27607 states have (on average 2.9437823740355706) internal successors, (81269), 27609 states have internal predecessors, (81269), 0 states have call successors, (0), 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:55:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27610 states to 27610 states and 81269 transitions. [2021-06-05 08:55:10,788 INFO L78 Accepts]: Start accepts. Automaton has 27610 states and 81269 transitions. Word has length 68 [2021-06-05 08:55:10,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:55:10,790 INFO L482 AbstractCegarLoop]: Abstraction has 27610 states and 81269 transitions. [2021-06-05 08:55:10,790 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 3.8333333333333335) internal successors, (115), 30 states have internal predecessors, (115), 0 states have call successors, (0), 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:55:10,790 INFO L276 IsEmpty]: Start isEmpty. Operand 27610 states and 81269 transitions. [2021-06-05 08:55:10,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 08:55:10,808 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:55:10,809 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:55:11,081 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2021-06-05 08:55:11,082 INFO L430 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:55:11,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:55:11,082 INFO L82 PathProgramCache]: Analyzing trace with hash 20636637, now seen corresponding path program 2 times [2021-06-05 08:55:11,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:55:11,082 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751172917] [2021-06-05 08:55:11,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:55:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:55:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:55:11,466 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:55:11,466 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751172917] [2021-06-05 08:55:11,466 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751172917] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:55:11,466 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591818874] [2021-06-05 08:55:11,466 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 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:55:11,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 08:55:11,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:55:11,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 57 conjunts are in the unsatisfiable core [2021-06-05 08:55:11,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:55:11,563 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:55:11,564 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:11,567 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:11,568 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:55:11,568 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:55:11,618 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:55:11,618 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:55:11,620 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:11,626 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:11,627 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:55:11,627 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2021-06-05 08:55:11,681 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:55:11,681 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:55:11,683 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:11,690 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:11,690 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:55:11,690 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:22 [2021-06-05 08:55:11,738 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:55:11,739 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:11,747 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:11,747 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:55:11,748 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2021-06-05 08:55:11,777 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:55:11,778 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:11,788 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:11,789 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:55:11,789 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2021-06-05 08:55:11,937 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-06-05 08:55:11,937 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 2 case distinctions, treesize of input 43 treesize of output 25 [2021-06-05 08:55:11,938 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:11,950 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:55:11,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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:55:11,957 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:11,981 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:11,988 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-06-05 08:55:11,989 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:99, output treesize:78 [2021-06-05 08:55:12,348 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:55:12,350 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:12,358 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:12,360 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:55:12,360 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:22 [2021-06-05 08:55:12,407 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:55:12,408 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:12,411 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:12,412 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:55:12,412 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2021-06-05 08:55:12,444 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:55:12,445 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591818874] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:55:12,445 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:55:12,445 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 28 [2021-06-05 08:55:12,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835985327] [2021-06-05 08:55:12,445 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 08:55:12,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:55:12,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 08:55:12,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2021-06-05 08:55:12,446 INFO L87 Difference]: Start difference. First operand 27610 states and 81269 transitions. Second operand has 28 states, 28 states have (on average 4.25) internal successors, (119), 28 states have internal predecessors, (119), 0 states have call successors, (0), 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:55:16,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:55:16,426 INFO L93 Difference]: Finished difference Result 47214 states and 139112 transitions. [2021-06-05 08:55:16,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-06-05 08:55:16,426 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.25) internal successors, (119), 28 states have internal predecessors, (119), 0 states have call successors, (0), 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 68 [2021-06-05 08:55:16,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:55:16,489 INFO L225 Difference]: With dead ends: 47214 [2021-06-05 08:55:16,490 INFO L226 Difference]: Without dead ends: 47214 [2021-06-05 08:55:16,490 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 2320.0ms TimeCoverageRelationStatistics Valid=556, Invalid=3476, Unknown=0, NotChecked=0, Total=4032 [2021-06-05 08:55:16,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47214 states. [2021-06-05 08:55:17,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47214 to 26050. [2021-06-05 08:55:17,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26050 states, 26047 states have (on average 2.939647560179675) internal successors, (76569), 26049 states have internal predecessors, (76569), 0 states have call successors, (0), 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:55:17,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26050 states to 26050 states and 76569 transitions. [2021-06-05 08:55:17,102 INFO L78 Accepts]: Start accepts. Automaton has 26050 states and 76569 transitions. Word has length 68 [2021-06-05 08:55:17,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:55:17,103 INFO L482 AbstractCegarLoop]: Abstraction has 26050 states and 76569 transitions. [2021-06-05 08:55:17,103 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 4.25) internal successors, (119), 28 states have internal predecessors, (119), 0 states have call successors, (0), 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:55:17,103 INFO L276 IsEmpty]: Start isEmpty. Operand 26050 states and 76569 transitions. [2021-06-05 08:55:17,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 08:55:17,141 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:55:17,141 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:55:17,357 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:55:17,357 INFO L430 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:55:17,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:55:17,357 INFO L82 PathProgramCache]: Analyzing trace with hash 236834045, now seen corresponding path program 2 times [2021-06-05 08:55:17,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:55:17,357 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462199546] [2021-06-05 08:55:17,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:55:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:55:17,476 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:55:17,476 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:55:17,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462199546] [2021-06-05 08:55:17,476 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462199546] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:55:17,476 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106050120] [2021-06-05 08:55:17,477 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 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:55:17,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:55:17,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:55:17,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 37 conjunts are in the unsatisfiable core [2021-06-05 08:55:17,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:55:17,705 INFO L354 Elim1Store]: treesize reduction 58, result has 31.8 percent of original size [2021-06-05 08:55:17,706 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 38 [2021-06-05 08:55:17,710 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:17,809 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:55:17,809 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 20 treesize of output 27 [2021-06-05 08:55:17,813 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:17,837 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:17,839 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:55:17,839 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:41 [2021-06-05 08:55:17,964 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:17,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 23 treesize of output 19 [2021-06-05 08:55:17,965 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:17,969 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:17,971 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:55:17,971 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:4 [2021-06-05 08:55:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:55:17,974 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106050120] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:55:17,974 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:55:17,974 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 20 [2021-06-05 08:55:17,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120061369] [2021-06-05 08:55:17,974 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:55:17,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:55:17,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:55:17,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2021-06-05 08:55:17,975 INFO L87 Difference]: Start difference. First operand 26050 states and 76569 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 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:55:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:55:18,900 INFO L93 Difference]: Finished difference Result 47998 states and 141593 transitions. [2021-06-05 08:55:18,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-05 08:55:18,901 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 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 68 [2021-06-05 08:55:18,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:55:18,969 INFO L225 Difference]: With dead ends: 47998 [2021-06-05 08:55:18,969 INFO L226 Difference]: Without dead ends: 47998 [2021-06-05 08:55:18,969 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 391.0ms TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2021-06-05 08:55:19,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47998 states. [2021-06-05 08:55:19,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47998 to 36886. [2021-06-05 08:55:19,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36886 states, 36883 states have (on average 2.9607678334191903) internal successors, (109202), 36885 states have internal predecessors, (109202), 0 states have call successors, (0), 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:55:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36886 states to 36886 states and 109202 transitions. [2021-06-05 08:55:19,760 INFO L78 Accepts]: Start accepts. Automaton has 36886 states and 109202 transitions. Word has length 68 [2021-06-05 08:55:19,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:55:19,760 INFO L482 AbstractCegarLoop]: Abstraction has 36886 states and 109202 transitions. [2021-06-05 08:55:19,760 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 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:55:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 36886 states and 109202 transitions. [2021-06-05 08:55:19,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 08:55:19,780 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:55:19,780 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:55:19,980 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable82 [2021-06-05 08:55:19,980 INFO L430 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:55:19,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:55:19,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1293563257, now seen corresponding path program 3 times [2021-06-05 08:55:19,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:55:19,981 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669745444] [2021-06-05 08:55:19,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:55:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:55:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:55:20,114 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:55:20,114 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669745444] [2021-06-05 08:55:20,115 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669745444] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:55:20,115 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013133933] [2021-06-05 08:55:20,115 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 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:55:20,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:55:20,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:55:20,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 54 conjunts are in the unsatisfiable core [2021-06-05 08:55:20,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:55:20,201 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:55:20,202 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:20,205 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:20,205 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:55:20,206 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:55:20,244 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:55:20,244 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:55:20,246 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:20,258 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:20,259 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:55:20,259 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-06-05 08:55:20,305 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:55:20,306 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:20,311 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:20,312 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:55:20,312 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 08:55:20,340 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:55:20,342 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:20,352 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:20,353 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:55:20,353 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2021-06-05 08:55:20,467 INFO L354 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2021-06-05 08:55:20,468 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 43 treesize of output 25 [2021-06-05 08:55:20,469 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:20,475 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:20,476 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:55:20,476 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:29 [2021-06-05 08:55:20,526 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:55:20,527 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:20,528 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:20,529 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:55:20,529 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:55:20,546 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:55:20,546 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013133933] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:55:20,546 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:55:20,546 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 25 [2021-06-05 08:55:20,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19048355] [2021-06-05 08:55:20,547 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 08:55:20,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:55:20,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 08:55:20,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:55:20,547 INFO L87 Difference]: Start difference. First operand 36886 states and 109202 transitions. Second operand has 25 states, 25 states have (on average 3.52) internal successors, (88), 25 states have internal predecessors, (88), 0 states have call successors, (0), 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:55:21,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:55:21,539 INFO L93 Difference]: Finished difference Result 42100 states and 123847 transitions. [2021-06-05 08:55:21,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-06-05 08:55:21,539 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.52) internal successors, (88), 25 states have internal predecessors, (88), 0 states have call successors, (0), 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 68 [2021-06-05 08:55:21,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:55:21,721 INFO L225 Difference]: With dead ends: 42100 [2021-06-05 08:55:21,721 INFO L226 Difference]: Without dead ends: 42100 [2021-06-05 08:55:21,721 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 444.2ms TimeCoverageRelationStatistics Valid=213, Invalid=1193, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 08:55:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42100 states. [2021-06-05 08:55:22,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42100 to 36940. [2021-06-05 08:55:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36940 states, 36937 states have (on average 2.96058153071446) internal successors, (109355), 36939 states have internal predecessors, (109355), 0 states have call successors, (0), 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:55:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36940 states to 36940 states and 109355 transitions. [2021-06-05 08:55:22,424 INFO L78 Accepts]: Start accepts. Automaton has 36940 states and 109355 transitions. Word has length 68 [2021-06-05 08:55:22,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:55:22,424 INFO L482 AbstractCegarLoop]: Abstraction has 36940 states and 109355 transitions. [2021-06-05 08:55:22,424 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 3.52) internal successors, (88), 25 states have internal predecessors, (88), 0 states have call successors, (0), 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:55:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 36940 states and 109355 transitions. [2021-06-05 08:55:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 08:55:22,444 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:55:22,444 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:55:22,661 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:55:22,661 INFO L430 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:55:22,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:55:22,661 INFO L82 PathProgramCache]: Analyzing trace with hash 441496559, now seen corresponding path program 4 times [2021-06-05 08:55:22,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:55:22,661 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882042415] [2021-06-05 08:55:22,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:55:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:55:22,807 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:55:22,807 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:55:22,807 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882042415] [2021-06-05 08:55:22,807 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882042415] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:55:22,807 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142971223] [2021-06-05 08:55:22,807 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 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:55:22,872 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:55:22,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:55:22,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 43 conjunts are in the unsatisfiable core [2021-06-05 08:55:22,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:55:22,902 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:55:22,903 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:22,905 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:22,906 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:55:22,906 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 08:55:22,962 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:55:22,962 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:55:22,963 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:22,966 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:22,966 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:55:22,966 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2021-06-05 08:55:23,055 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 20 treesize of output 19 [2021-06-05 08:55:23,056 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:23,061 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:23,062 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:55:23,062 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2021-06-05 08:55:23,150 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:55:23,150 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 20 treesize of output 27 [2021-06-05 08:55:23,153 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:23,181 INFO L354 Elim1Store]: treesize reduction 58, result has 31.8 percent of original size [2021-06-05 08:55:23,182 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 38 [2021-06-05 08:55:23,192 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:23,216 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:23,218 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:55:23,218 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:41 [2021-06-05 08:55:23,353 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:23,354 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 23 treesize of output 19 [2021-06-05 08:55:23,354 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:23,358 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:23,359 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:55:23,359 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:4 [2021-06-05 08:55:23,363 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:55:23,363 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142971223] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:55:23,363 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:55:23,363 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2021-06-05 08:55:23,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532740666] [2021-06-05 08:55:23,364 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 08:55:23,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:55:23,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 08:55:23,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2021-06-05 08:55:23,364 INFO L87 Difference]: Start difference. First operand 36940 states and 109355 transitions. Second operand has 27 states, 27 states have (on average 3.962962962962963) internal successors, (107), 27 states have internal predecessors, (107), 0 states have call successors, (0), 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:55:26,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:55:26,267 INFO L93 Difference]: Finished difference Result 90916 states and 269091 transitions. [2021-06-05 08:55:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-05 08:55:26,267 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.962962962962963) internal successors, (107), 27 states have internal predecessors, (107), 0 states have call successors, (0), 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 68 [2021-06-05 08:55:26,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:55:26,419 INFO L225 Difference]: With dead ends: 90916 [2021-06-05 08:55:26,419 INFO L226 Difference]: Without dead ends: 90916 [2021-06-05 08:55:26,420 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 1236.5ms TimeCoverageRelationStatistics Valid=538, Invalid=3244, Unknown=0, NotChecked=0, Total=3782 [2021-06-05 08:55:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90916 states. [2021-06-05 08:55:27,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90916 to 43630. [2021-06-05 08:55:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43630 states, 43627 states have (on average 2.9642194054140782) internal successors, (129320), 43629 states have internal predecessors, (129320), 0 states have call successors, (0), 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:55:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43630 states to 43630 states and 129320 transitions. [2021-06-05 08:55:27,619 INFO L78 Accepts]: Start accepts. Automaton has 43630 states and 129320 transitions. Word has length 68 [2021-06-05 08:55:27,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:55:27,619 INFO L482 AbstractCegarLoop]: Abstraction has 43630 states and 129320 transitions. [2021-06-05 08:55:27,619 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 3.962962962962963) internal successors, (107), 27 states have internal predecessors, (107), 0 states have call successors, (0), 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:55:27,619 INFO L276 IsEmpty]: Start isEmpty. Operand 43630 states and 129320 transitions. [2021-06-05 08:55:27,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-05 08:55:27,639 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:55:27,639 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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:55:27,840 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:55:27,841 INFO L430 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:55:27,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:55:27,841 INFO L82 PathProgramCache]: Analyzing trace with hash 310680499, now seen corresponding path program 5 times [2021-06-05 08:55:27,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:55:27,842 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511001803] [2021-06-05 08:55:27,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:55:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:55:28,042 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:55:28,042 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:55:28,042 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511001803] [2021-06-05 08:55:28,042 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511001803] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:55:28,042 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550222918] [2021-06-05 08:55:28,042 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 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:55:28,110 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 08:55:28,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:55:28,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 54 conjunts are in the unsatisfiable core [2021-06-05 08:55:28,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:55:28,129 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:55:28,129 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:28,133 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:28,133 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:55:28,134 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:55:28,148 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:55:28,148 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:55:28,149 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:28,152 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:28,153 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:55:28,153 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 08:55:28,231 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:55:28,231 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:28,237 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:28,237 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:55:28,237 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 08:55:28,382 INFO L354 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2021-06-05 08:55:28,382 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 2 case distinctions, treesize of input 43 treesize of output 25 [2021-06-05 08:55:28,383 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:28,389 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:28,390 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:55:28,390 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:29 [2021-06-05 08:55:28,443 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:55:28,444 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:28,449 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:28,450 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:55:28,450 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2021-06-05 08:55:28,479 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:55:28,479 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:55:28,480 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:55:28,481 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:55:28,481 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:55:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:55:28,495 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550222918] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:55:28,495 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:55:28,495 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 26 [2021-06-05 08:55:28,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161065914] [2021-06-05 08:55:28,495 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 08:55:28,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:55:28,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 08:55:28,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:55:28,496 INFO L87 Difference]: Start difference. First operand 43630 states and 129320 transitions. Second operand has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 0 states have call successors, (0), 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:55:30,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:55:30,772 INFO L93 Difference]: Finished difference Result 74730 states and 219699 transitions. [2021-06-05 08:55:30,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-06-05 08:55:30,772 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 0 states have call successors, (0), 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 68 [2021-06-05 08:55:30,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:55:30,895 INFO L225 Difference]: With dead ends: 74730 [2021-06-05 08:55:30,895 INFO L226 Difference]: Without dead ends: 74730 [2021-06-05 08:55:30,895 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 802.6ms TimeCoverageRelationStatistics Valid=440, Invalid=2422, Unknown=0, NotChecked=0, Total=2862 [2021-06-05 08:55:31,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74730 states. [2021-06-05 08:55:31,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74730 to 51712. [2021-06-05 08:55:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51712 states, 51709 states have (on average 2.963990794639231) internal successors, (153265), 51711 states have internal predecessors, (153265), 0 states have call successors, (0), 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:55:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51712 states to 51712 states and 153265 transitions. [2021-06-05 08:55:32,011 INFO L78 Accepts]: Start accepts. Automaton has 51712 states and 153265 transitions. Word has length 68 [2021-06-05 08:55:32,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:55:32,011 INFO L482 AbstractCegarLoop]: Abstraction has 51712 states and 153265 transitions. [2021-06-05 08:55:32,011 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 26 states have internal predecessors, (88), 0 states have call successors, (0), 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:55:32,011 INFO L276 IsEmpty]: Start isEmpty. Operand 51712 states and 153265 transitions. [2021-06-05 08:55:32,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:55:32,038 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:55:32,039 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, 1, 1, 1, 1] [2021-06-05 08:55:32,239 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:55:32,240 INFO L430 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:55:32,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:55:32,240 INFO L82 PathProgramCache]: Analyzing trace with hash 488334977, now seen corresponding path program 1 times [2021-06-05 08:55:32,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:55:32,240 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922802319] [2021-06-05 08:55:32,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:55:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:55:32,465 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:55:32,465 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:55:32,466 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922802319] [2021-06-05 08:55:32,466 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922802319] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:55:32,466 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:55:32,466 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 08:55:32,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708576651] [2021-06-05 08:55:32,466 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:55:32,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:55:32,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:55:32,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 08:55:32,466 INFO L87 Difference]: Start difference. First operand 51712 states and 153265 transitions. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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:55:33,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:55:34,000 INFO L93 Difference]: Finished difference Result 60278 states and 178211 transitions. [2021-06-05 08:55:34,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 08:55:34,000 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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 71 [2021-06-05 08:55:34,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:55:34,097 INFO L225 Difference]: With dead ends: 60278 [2021-06-05 08:55:34,097 INFO L226 Difference]: Without dead ends: 60278 [2021-06-05 08:55:34,098 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 546.1ms TimeCoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 08:55:34,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60278 states. [2021-06-05 08:55:34,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60278 to 51820. [2021-06-05 08:55:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51820 states, 51817 states have (on average 2.9630237180847985) internal successors, (153535), 51819 states have internal predecessors, (153535), 0 states have call successors, (0), 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:55:35,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51820 states to 51820 states and 153535 transitions. [2021-06-05 08:55:35,114 INFO L78 Accepts]: Start accepts. Automaton has 51820 states and 153535 transitions. Word has length 71 [2021-06-05 08:55:35,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:55:35,114 INFO L482 AbstractCegarLoop]: Abstraction has 51820 states and 153535 transitions. [2021-06-05 08:55:35,114 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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:55:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand 51820 states and 153535 transitions. [2021-06-05 08:55:35,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:55:35,313 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:55:35,313 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, 1, 1, 1, 1] [2021-06-05 08:55:35,313 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2021-06-05 08:55:35,313 INFO L430 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:55:35,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:55:35,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1242354501, now seen corresponding path program 2 times [2021-06-05 08:55:35,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:55:35,314 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296281357] [2021-06-05 08:55:35,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:55:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:55:35,537 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:55:35,538 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:55:35,538 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296281357] [2021-06-05 08:55:35,538 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296281357] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:55:35,538 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:55:35,538 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 08:55:35,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859269734] [2021-06-05 08:55:35,538 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 08:55:35,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:55:35,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 08:55:35,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:55:35,539 INFO L87 Difference]: Start difference. First operand 51820 states and 153535 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:55:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:55:36,786 INFO L93 Difference]: Finished difference Result 78876 states and 233744 transitions. [2021-06-05 08:55:36,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 08:55:36,787 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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 71 [2021-06-05 08:55:36,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:55:36,916 INFO L225 Difference]: With dead ends: 78876 [2021-06-05 08:55:36,917 INFO L226 Difference]: Without dead ends: 78876 [2021-06-05 08:55:36,917 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 351.8ms TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2021-06-05 08:55:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78876 states. [2021-06-05 08:55:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78876 to 54900. [2021-06-05 08:55:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54900 states, 54897 states have (on average 2.97304042115234) internal successors, (163211), 54899 states have internal predecessors, (163211), 0 states have call successors, (0), 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:55:38,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54900 states to 54900 states and 163211 transitions. [2021-06-05 08:55:38,240 INFO L78 Accepts]: Start accepts. Automaton has 54900 states and 163211 transitions. Word has length 71 [2021-06-05 08:55:38,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:55:38,240 INFO L482 AbstractCegarLoop]: Abstraction has 54900 states and 163211 transitions. [2021-06-05 08:55:38,240 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:55:38,240 INFO L276 IsEmpty]: Start isEmpty. Operand 54900 states and 163211 transitions. [2021-06-05 08:55:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:55:38,277 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:55:38,277 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, 1, 1, 1, 1] [2021-06-05 08:55:38,277 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2021-06-05 08:55:38,277 INFO L430 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:55:38,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:55:38,277 INFO L82 PathProgramCache]: Analyzing trace with hash 824090685, now seen corresponding path program 1 times [2021-06-05 08:55:38,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:55:38,277 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285824064] [2021-06-05 08:55:38,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:55:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:55:38,568 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:55:38,569 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:55:38,569 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285824064] [2021-06-05 08:55:38,569 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285824064] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:55:38,569 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:55:38,569 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-06-05 08:55:38,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043017980] [2021-06-05 08:55:38,569 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 08:55:38,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:55:38,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 08:55:38,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-06-05 08:55:38,570 INFO L87 Difference]: Start difference. First operand 54900 states and 163211 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 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:55:39,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:55:39,858 INFO L93 Difference]: Finished difference Result 96454 states and 285718 transitions. [2021-06-05 08:55:39,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 08:55:39,859 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 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 71 [2021-06-05 08:55:39,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:55:40,009 INFO L225 Difference]: With dead ends: 96454 [2021-06-05 08:55:40,010 INFO L226 Difference]: Without dead ends: 96454 [2021-06-05 08:55:40,010 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 437.3ms TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:55:40,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96454 states. [2021-06-05 08:55:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96454 to 73060. [2021-06-05 08:55:41,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73060 states, 73057 states have (on average 2.9916092913752275) internal successors, (218558), 73059 states have internal predecessors, (218558), 0 states have call successors, (0), 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:55:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73060 states to 73060 states and 218558 transitions. [2021-06-05 08:55:41,569 INFO L78 Accepts]: Start accepts. Automaton has 73060 states and 218558 transitions. Word has length 71 [2021-06-05 08:55:41,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:55:41,570 INFO L482 AbstractCegarLoop]: Abstraction has 73060 states and 218558 transitions. [2021-06-05 08:55:41,570 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 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:55:41,570 INFO L276 IsEmpty]: Start isEmpty. Operand 73060 states and 218558 transitions. [2021-06-05 08:55:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:55:41,615 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:55:41,615 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, 1, 1, 1, 1] [2021-06-05 08:55:41,615 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2021-06-05 08:55:41,615 INFO L430 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:55:41,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:55:41,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1313217147, now seen corresponding path program 2 times [2021-06-05 08:55:41,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:55:41,616 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358767604] [2021-06-05 08:55:41,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:55:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:55:41,736 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:55:41,736 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:55:41,736 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358767604] [2021-06-05 08:55:41,736 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358767604] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:55:41,736 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:55:41,736 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 08:55:41,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850420445] [2021-06-05 08:55:41,737 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 08:55:41,737 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:55:41,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 08:55:41,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:55:41,737 INFO L87 Difference]: Start difference. First operand 73060 states and 218558 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:55:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:55:43,133 INFO L93 Difference]: Finished difference Result 101872 states and 303757 transitions. [2021-06-05 08:55:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 08:55:43,134 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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 71 [2021-06-05 08:55:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:55:43,320 INFO L225 Difference]: With dead ends: 101872 [2021-06-05 08:55:43,320 INFO L226 Difference]: Without dead ends: 101872 [2021-06-05 08:55:43,320 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 318.8ms TimeCoverageRelationStatistics Valid=189, Invalid=1001, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 08:55:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101872 states. [2021-06-05 08:55:44,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101872 to 75490. [2021-06-05 08:55:44,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75490 states, 75487 states have (on average 2.998728257845722) internal successors, (226365), 75489 states have internal predecessors, (226365), 0 states have call successors, (0), 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:55:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75490 states to 75490 states and 226365 transitions. [2021-06-05 08:55:45,109 INFO L78 Accepts]: Start accepts. Automaton has 75490 states and 226365 transitions. Word has length 71 [2021-06-05 08:55:45,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:55:45,109 INFO L482 AbstractCegarLoop]: Abstraction has 75490 states and 226365 transitions. [2021-06-05 08:55:45,109 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:55:45,109 INFO L276 IsEmpty]: Start isEmpty. Operand 75490 states and 226365 transitions. [2021-06-05 08:55:45,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:55:45,162 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:55:45,163 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, 1, 1, 1, 1] [2021-06-05 08:55:45,163 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2021-06-05 08:55:45,163 INFO L430 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:55:45,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:55:45,163 INFO L82 PathProgramCache]: Analyzing trace with hash 170215667, now seen corresponding path program 3 times [2021-06-05 08:55:45,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:55:45,163 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091690785] [2021-06-05 08:55:45,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:55:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:55:45,682 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:55:45,682 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:55:45,682 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091690785] [2021-06-05 08:55:45,682 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091690785] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:55:45,682 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:55:45,682 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 08:55:45,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675707045] [2021-06-05 08:55:45,683 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 08:55:45,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:55:45,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 08:55:45,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 08:55:45,683 INFO L87 Difference]: Start difference. First operand 75490 states and 226365 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 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:55:47,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:55:47,341 INFO L93 Difference]: Finished difference Result 94484 states and 282229 transitions. [2021-06-05 08:55:47,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 08:55:47,342 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 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 71 [2021-06-05 08:55:47,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:55:47,491 INFO L225 Difference]: With dead ends: 94484 [2021-06-05 08:55:47,491 INFO L226 Difference]: Without dead ends: 94484 [2021-06-05 08:55:47,492 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 468.6ms TimeCoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 08:55:47,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94484 states. [2021-06-05 08:55:48,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94484 to 78254. [2021-06-05 08:55:48,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78254 states, 78251 states have (on average 2.9989520900691367) internal successors, (234671), 78253 states have internal predecessors, (234671), 0 states have call successors, (0), 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:55:49,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78254 states to 78254 states and 234671 transitions. [2021-06-05 08:55:49,342 INFO L78 Accepts]: Start accepts. Automaton has 78254 states and 234671 transitions. Word has length 71 [2021-06-05 08:55:49,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:55:49,342 INFO L482 AbstractCegarLoop]: Abstraction has 78254 states and 234671 transitions. [2021-06-05 08:55:49,342 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 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:55:49,343 INFO L276 IsEmpty]: Start isEmpty. Operand 78254 states and 234671 transitions. [2021-06-05 08:55:49,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:55:49,393 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:55:49,393 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, 1, 1, 1, 1] [2021-06-05 08:55:49,394 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2021-06-05 08:55:49,394 INFO L430 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:55:49,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:55:49,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1305306471, now seen corresponding path program 4 times [2021-06-05 08:55:49,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:55:49,394 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995642104] [2021-06-05 08:55:49,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:55:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:55:49,529 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:55:49,529 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:55:49,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995642104] [2021-06-05 08:55:49,529 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995642104] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:55:49,529 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:55:49,529 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 08:55:49,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138087100] [2021-06-05 08:55:49,529 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:55:49,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:55:49,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:55:49,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-06-05 08:55:49,530 INFO L87 Difference]: Start difference. First operand 78254 states and 234671 transitions. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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:55:50,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:55:50,364 INFO L93 Difference]: Finished difference Result 95570 states and 285487 transitions. [2021-06-05 08:55:50,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 08:55:50,364 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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 71 [2021-06-05 08:55:50,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:55:50,746 INFO L225 Difference]: With dead ends: 95570 [2021-06-05 08:55:50,746 INFO L226 Difference]: Without dead ends: 95570 [2021-06-05 08:55:50,746 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 255.2ms TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2021-06-05 08:55:51,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95570 states. [2021-06-05 08:55:51,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95570 to 78634. [2021-06-05 08:55:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78634 states, 78631 states have (on average 2.998499319606771) internal successors, (235775), 78633 states have internal predecessors, (235775), 0 states have call successors, (0), 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:55:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78634 states to 78634 states and 235775 transitions. [2021-06-05 08:55:52,167 INFO L78 Accepts]: Start accepts. Automaton has 78634 states and 235775 transitions. Word has length 71 [2021-06-05 08:55:52,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:55:52,167 INFO L482 AbstractCegarLoop]: Abstraction has 78634 states and 235775 transitions. [2021-06-05 08:55:52,167 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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:55:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand 78634 states and 235775 transitions. [2021-06-05 08:55:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:55:52,219 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:55:52,219 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, 1, 1, 1, 1] [2021-06-05 08:55:52,219 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2021-06-05 08:55:52,220 INFO L430 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:55:52,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:55:52,220 INFO L82 PathProgramCache]: Analyzing trace with hash -404177437, now seen corresponding path program 3 times [2021-06-05 08:55:52,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:55:52,220 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640973861] [2021-06-05 08:55:52,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:55:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:55:52,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:55:52,347 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:55:52,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640973861] [2021-06-05 08:55:52,347 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640973861] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:55:52,347 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:55:52,347 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 08:55:52,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022104817] [2021-06-05 08:55:52,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 08:55:52,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:55:52,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 08:55:52,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:55:52,348 INFO L87 Difference]: Start difference. First operand 78634 states and 235775 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:55:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:55:53,600 INFO L93 Difference]: Finished difference Result 105232 states and 314171 transitions. [2021-06-05 08:55:53,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 08:55:53,601 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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 71 [2021-06-05 08:55:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:55:53,784 INFO L225 Difference]: With dead ends: 105232 [2021-06-05 08:55:53,784 INFO L226 Difference]: Without dead ends: 105232 [2021-06-05 08:55:53,785 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 269.8ms TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:55:54,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105232 states. [2021-06-05 08:55:55,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105232 to 84668. [2021-06-05 08:55:55,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84668 states, 84665 states have (on average 3.005456800330715) internal successors, (254457), 84667 states have internal predecessors, (254457), 0 states have call successors, (0), 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:55:55,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84668 states to 84668 states and 254457 transitions. [2021-06-05 08:55:55,677 INFO L78 Accepts]: Start accepts. Automaton has 84668 states and 254457 transitions. Word has length 71 [2021-06-05 08:55:55,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:55:55,677 INFO L482 AbstractCegarLoop]: Abstraction has 84668 states and 254457 transitions. [2021-06-05 08:55:55,677 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:55:55,678 INFO L276 IsEmpty]: Start isEmpty. Operand 84668 states and 254457 transitions. [2021-06-05 08:55:55,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:55:55,739 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:55:55,739 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, 1, 1, 1, 1] [2021-06-05 08:55:55,739 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2021-06-05 08:55:55,739 INFO L430 AbstractCegarLoop]: === Iteration 19 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:55:55,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:55:55,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1666683329, now seen corresponding path program 4 times [2021-06-05 08:55:55,739 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:55:55,740 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435251425] [2021-06-05 08:55:55,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:55:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:55:55,890 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:55:55,890 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:55:55,890 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435251425] [2021-06-05 08:55:55,890 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435251425] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:55:55,890 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:55:55,891 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 08:55:55,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412266517] [2021-06-05 08:55:55,891 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 08:55:55,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:55:55,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 08:55:55,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:55:55,892 INFO L87 Difference]: Start difference. First operand 84668 states and 254457 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:55:57,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:55:57,451 INFO L93 Difference]: Finished difference Result 142534 states and 425735 transitions. [2021-06-05 08:55:57,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 08:55:57,451 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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 71 [2021-06-05 08:55:57,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:55:57,707 INFO L225 Difference]: With dead ends: 142534 [2021-06-05 08:55:57,707 INFO L226 Difference]: Without dead ends: 142534 [2021-06-05 08:55:57,708 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 283.4ms TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:55:58,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142534 states. [2021-06-05 08:55:59,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142534 to 92800. [2021-06-05 08:55:59,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92800 states, 92797 states have (on average 3.016239749129821) internal successors, (279898), 92799 states have internal predecessors, (279898), 0 states have call successors, (0), 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:56:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92800 states to 92800 states and 279898 transitions. [2021-06-05 08:56:00,082 INFO L78 Accepts]: Start accepts. Automaton has 92800 states and 279898 transitions. Word has length 71 [2021-06-05 08:56:00,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:56:00,082 INFO L482 AbstractCegarLoop]: Abstraction has 92800 states and 279898 transitions. [2021-06-05 08:56:00,082 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:56:00,082 INFO L276 IsEmpty]: Start isEmpty. Operand 92800 states and 279898 transitions. [2021-06-05 08:56:00,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:56:00,159 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:56:00,160 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, 1, 1, 1, 1] [2021-06-05 08:56:00,160 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2021-06-05 08:56:00,160 INFO L430 AbstractCegarLoop]: === Iteration 20 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:56:00,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:56:00,160 INFO L82 PathProgramCache]: Analyzing trace with hash -546691847, now seen corresponding path program 5 times [2021-06-05 08:56:00,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:56:00,160 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760254482] [2021-06-05 08:56:00,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:56:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:56:00,284 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:56:00,284 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:56:00,285 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760254482] [2021-06-05 08:56:00,285 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760254482] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:56:00,285 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:56:00,285 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 08:56:00,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967397522] [2021-06-05 08:56:00,285 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 08:56:00,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:56:00,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 08:56:00,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:56:00,285 INFO L87 Difference]: Start difference. First operand 92800 states and 279898 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:56:00,850 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2021-06-05 08:56:01,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:56:01,763 INFO L93 Difference]: Finished difference Result 120320 states and 361348 transitions. [2021-06-05 08:56:01,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 08:56:01,763 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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 71 [2021-06-05 08:56:01,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:56:01,967 INFO L225 Difference]: With dead ends: 120320 [2021-06-05 08:56:01,967 INFO L226 Difference]: Without dead ends: 120320 [2021-06-05 08:56:01,968 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 550.8ms TimeCoverageRelationStatistics Valid=136, Invalid=794, Unknown=0, NotChecked=0, Total=930 [2021-06-05 08:56:02,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120320 states. [2021-06-05 08:56:03,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120320 to 96072. [2021-06-05 08:56:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96072 states, 96069 states have (on average 3.0208912344252568) internal successors, (290214), 96071 states have internal predecessors, (290214), 0 states have call successors, (0), 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:56:04,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96072 states to 96072 states and 290214 transitions. [2021-06-05 08:56:04,142 INFO L78 Accepts]: Start accepts. Automaton has 96072 states and 290214 transitions. Word has length 71 [2021-06-05 08:56:04,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:56:04,142 INFO L482 AbstractCegarLoop]: Abstraction has 96072 states and 290214 transitions. [2021-06-05 08:56:04,142 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:56:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 96072 states and 290214 transitions. [2021-06-05 08:56:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:56:04,230 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:56:04,230 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, 1, 1, 1, 1] [2021-06-05 08:56:04,230 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2021-06-05 08:56:04,230 INFO L430 AbstractCegarLoop]: === Iteration 21 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:56:04,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:56:04,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1809197739, now seen corresponding path program 6 times [2021-06-05 08:56:04,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:56:04,231 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360076425] [2021-06-05 08:56:04,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:56:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:56:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:56:04,517 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:56:04,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360076425] [2021-06-05 08:56:04,517 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360076425] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:56:04,517 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022769146] [2021-06-05 08:56:04,517 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 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:56:04,590 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 08:56:04,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:56:04,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 56 conjunts are in the unsatisfiable core [2021-06-05 08:56:04,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:56:04,728 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 13 treesize of output 9 [2021-06-05 08:56:04,729 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:56:04,736 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:56:04,737 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:56:04,737 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2021-06-05 08:56:04,785 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-06-05 08:56:04,785 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 25 treesize of output 24 [2021-06-05 08:56:04,787 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:56:04,794 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:56:04,797 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:56:04,797 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2021-06-05 08:56:05,321 INFO L446 ElimStorePlain]: Different costs {4=[|v_#memory_int_125|], 9=[v_prenex_23]} [2021-06-05 08:56:05,342 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:56:05,342 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:56:05,344 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:56:05,372 INFO L354 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2021-06-05 08:56:05,373 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 43 treesize of output 33 [2021-06-05 08:56:05,374 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:56:05,413 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:56:05,442 INFO L354 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2021-06-05 08:56:05,442 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 3 case distinctions, treesize of input 26 treesize of output 40 [2021-06-05 08:56:05,443 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 08:56:05,480 INFO L354 Elim1Store]: treesize reduction 81, result has 28.9 percent of original size [2021-06-05 08:56:05,480 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 4 case distinctions, treesize of input 50 treesize of output 46 [2021-06-05 08:56:05,482 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 08:56:05,523 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:56:05,554 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 08:56:05,554 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:163, output treesize:130 [2021-06-05 08:56:05,782 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_29], 1=[|#memory_int|]} [2021-06-05 08:56:05,784 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:56:05,785 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:56:05,790 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:56:05,795 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:56:05,795 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:56:05,796 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:56:05,800 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:56:05,801 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:56:05,801 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:7 [2021-06-05 08:56:05,823 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:56:05,823 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022769146] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:56:05,823 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:56:05,823 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [19] total 30 [2021-06-05 08:56:05,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661120238] [2021-06-05 08:56:05,823 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:56:05,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:56:05,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:56:05,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:56:05,824 INFO L87 Difference]: Start difference. First operand 96072 states and 290214 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 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:56:07,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:56:07,203 INFO L93 Difference]: Finished difference Result 123056 states and 370032 transitions. [2021-06-05 08:56:07,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 08:56:07,205 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 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 71 [2021-06-05 08:56:07,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:56:07,685 INFO L225 Difference]: With dead ends: 123056 [2021-06-05 08:56:07,685 INFO L226 Difference]: Without dead ends: 123056 [2021-06-05 08:56:07,685 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1224.5ms TimeCoverageRelationStatistics Valid=123, Invalid=1067, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 08:56:08,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123056 states. [2021-06-05 08:56:09,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123056 to 96168. [2021-06-05 08:56:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96168 states, 96165 states have (on average 3.020745593511153) internal successors, (290490), 96167 states have internal predecessors, (290490), 0 states have call successors, (0), 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:56:09,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96168 states to 96168 states and 290490 transitions. [2021-06-05 08:56:09,554 INFO L78 Accepts]: Start accepts. Automaton has 96168 states and 290490 transitions. Word has length 71 [2021-06-05 08:56:09,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:56:09,554 INFO L482 AbstractCegarLoop]: Abstraction has 96168 states and 290490 transitions. [2021-06-05 08:56:09,554 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 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:56:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 96168 states and 290490 transitions. [2021-06-05 08:56:09,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:56:09,644 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:56:09,644 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, 1, 1, 1, 1] [2021-06-05 08:56:09,845 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2021-06-05 08:56:09,845 INFO L430 AbstractCegarLoop]: === Iteration 22 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:56:09,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:56:09,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1336495069, now seen corresponding path program 5 times [2021-06-05 08:56:09,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:56:09,847 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884854586] [2021-06-05 08:56:09,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:56:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:56:10,384 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:56:10,384 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:56:10,384 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884854586] [2021-06-05 08:56:10,384 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884854586] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:56:10,385 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:56:10,385 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 08:56:10,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568438762] [2021-06-05 08:56:10,385 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 08:56:10,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:56:10,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 08:56:10,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:56:10,385 INFO L87 Difference]: Start difference. First operand 96168 states and 290490 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:56:11,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:56:11,984 INFO L93 Difference]: Finished difference Result 138943 states and 417398 transitions. [2021-06-05 08:56:11,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-06-05 08:56:11,985 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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 71 [2021-06-05 08:56:11,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:56:12,542 INFO L225 Difference]: With dead ends: 138943 [2021-06-05 08:56:12,542 INFO L226 Difference]: Without dead ends: 138943 [2021-06-05 08:56:12,542 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 550.3ms TimeCoverageRelationStatistics Valid=230, Invalid=1330, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 08:56:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138943 states. [2021-06-05 08:56:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138943 to 97523. [2021-06-05 08:56:14,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97523 states, 97520 states have (on average 3.01879614438064) internal successors, (294393), 97522 states have internal predecessors, (294393), 0 states have call successors, (0), 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:56:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97523 states to 97523 states and 294393 transitions. [2021-06-05 08:56:14,504 INFO L78 Accepts]: Start accepts. Automaton has 97523 states and 294393 transitions. Word has length 71 [2021-06-05 08:56:14,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:56:14,504 INFO L482 AbstractCegarLoop]: Abstraction has 97523 states and 294393 transitions. [2021-06-05 08:56:14,505 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:56:14,505 INFO L276 IsEmpty]: Start isEmpty. Operand 97523 states and 294393 transitions. [2021-06-05 08:56:14,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:56:14,597 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:56:14,598 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, 1, 1, 1, 1] [2021-06-05 08:56:14,598 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2021-06-05 08:56:14,598 INFO L430 AbstractCegarLoop]: === Iteration 23 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:56:14,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:56:14,598 INFO L82 PathProgramCache]: Analyzing trace with hash 146937745, now seen corresponding path program 6 times [2021-06-05 08:56:14,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:56:14,598 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139042545] [2021-06-05 08:56:14,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:56:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:56:14,929 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2021-06-05 08:56:15,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:56:15,353 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:56:15,353 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139042545] [2021-06-05 08:56:15,353 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139042545] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:56:15,353 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162378855] [2021-06-05 08:56:15,353 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 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:56:15,419 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 08:56:15,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:56:15,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 56 conjunts are in the unsatisfiable core [2021-06-05 08:56:15,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:56:15,513 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 13 treesize of output 9 [2021-06-05 08:56:15,514 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:56:15,520 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:56:15,520 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:56:15,520 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2021-06-05 08:56:15,595 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-06-05 08:56:15,595 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 25 treesize of output 24 [2021-06-05 08:56:15,596 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:56:15,605 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:56:15,607 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:56:15,607 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2021-06-05 08:56:15,855 INFO L446 ElimStorePlain]: Different costs {4=[|v_#memory_int_128|], 9=[v_prenex_35, v_prenex_32]} [2021-06-05 08:56:15,885 INFO L354 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2021-06-05 08:56:15,885 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 43 treesize of output 33 [2021-06-05 08:56:15,886 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:56:15,923 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:56:15,949 INFO L354 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2021-06-05 08:56:15,949 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 3 case distinctions, treesize of input 26 treesize of output 40 [2021-06-05 08:56:15,950 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:56:15,963 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:56:15,963 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:56:15,964 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 08:56:16,003 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:56:16,036 INFO L354 Elim1Store]: treesize reduction 81, result has 28.9 percent of original size [2021-06-05 08:56:16,037 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 4 case distinctions, treesize of input 50 treesize of output 46 [2021-06-05 08:56:16,038 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 08:56:16,078 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:56:16,102 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 08:56:16,102 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:163, output treesize:130 [2021-06-05 08:56:17,780 WARN L205 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2021-06-05 08:56:18,025 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_39], 1=[|#memory_int|]} [2021-06-05 08:56:18,028 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:56:18,028 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:56:18,033 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:56:18,037 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:56:18,038 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:56:18,039 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:56:18,042 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:56:18,043 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:56:18,043 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:7 [2021-06-05 08:56:18,066 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:56:18,067 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162378855] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:56:18,067 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:56:18,067 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 28 [2021-06-05 08:56:18,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135452992] [2021-06-05 08:56:18,067 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:56:18,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:56:18,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:56:18,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2021-06-05 08:56:18,068 INFO L87 Difference]: Start difference. First operand 97523 states and 294393 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 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:56:21,285 WARN L205 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2021-06-05 08:56:21,554 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2021-06-05 08:56:22,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:56:22,313 INFO L93 Difference]: Finished difference Result 127557 states and 384068 transitions. [2021-06-05 08:56:22,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 08:56:22,314 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 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 71 [2021-06-05 08:56:22,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:56:22,539 INFO L225 Difference]: With dead ends: 127557 [2021-06-05 08:56:22,539 INFO L226 Difference]: Without dead ends: 127557 [2021-06-05 08:56:22,540 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 5542.1ms TimeCoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 08:56:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127557 states. [2021-06-05 08:56:24,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127557 to 97651. [2021-06-05 08:56:24,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97651 states, 97648 states have (on average 3.0186076519744387) internal successors, (294761), 97650 states have internal predecessors, (294761), 0 states have call successors, (0), 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:56:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97651 states to 97651 states and 294761 transitions. [2021-06-05 08:56:24,778 INFO L78 Accepts]: Start accepts. Automaton has 97651 states and 294761 transitions. Word has length 71 [2021-06-05 08:56:24,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:56:24,778 INFO L482 AbstractCegarLoop]: Abstraction has 97651 states and 294761 transitions. [2021-06-05 08:56:24,778 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 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:56:24,778 INFO L276 IsEmpty]: Start isEmpty. Operand 97651 states and 294761 transitions. [2021-06-05 08:56:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:56:24,866 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:56:24,866 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, 1, 1, 1, 1] [2021-06-05 08:56:25,066 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable145 [2021-06-05 08:56:25,067 INFO L430 AbstractCegarLoop]: === Iteration 24 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:56:25,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:56:25,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1116157697, now seen corresponding path program 7 times [2021-06-05 08:56:25,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:56:25,067 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100551220] [2021-06-05 08:56:25,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:56:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:56:25,160 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:56:25,161 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:56:25,161 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100551220] [2021-06-05 08:56:25,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100551220] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:56:25,161 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:56:25,161 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 08:56:25,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429448637] [2021-06-05 08:56:25,162 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 08:56:25,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:56:25,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 08:56:25,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-06-05 08:56:25,163 INFO L87 Difference]: Start difference. First operand 97651 states and 294761 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 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:56:26,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:56:26,544 INFO L93 Difference]: Finished difference Result 152582 states and 457595 transitions. [2021-06-05 08:56:26,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 08:56:26,544 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 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 71 [2021-06-05 08:56:26,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:56:26,805 INFO L225 Difference]: With dead ends: 152582 [2021-06-05 08:56:26,805 INFO L226 Difference]: Without dead ends: 152582 [2021-06-05 08:56:26,805 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 189.9ms TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:56:27,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152582 states. [2021-06-05 08:56:29,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152582 to 110934. [2021-06-05 08:56:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110934 states, 110931 states have (on average 3.013702211284492) internal successors, (334313), 110933 states have internal predecessors, (334313), 0 states have call successors, (0), 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:56:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110934 states to 110934 states and 334313 transitions. [2021-06-05 08:56:29,544 INFO L78 Accepts]: Start accepts. Automaton has 110934 states and 334313 transitions. Word has length 71 [2021-06-05 08:56:29,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:56:29,544 INFO L482 AbstractCegarLoop]: Abstraction has 110934 states and 334313 transitions. [2021-06-05 08:56:29,545 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 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:56:29,545 INFO L276 IsEmpty]: Start isEmpty. Operand 110934 states and 334313 transitions. [2021-06-05 08:56:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:56:29,631 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:56:29,631 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, 1, 1, 1, 1] [2021-06-05 08:56:29,631 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185 [2021-06-05 08:56:29,631 INFO L430 AbstractCegarLoop]: === Iteration 25 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:56:29,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:56:29,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1328584393, now seen corresponding path program 8 times [2021-06-05 08:56:29,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:56:29,632 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521710918] [2021-06-05 08:56:29,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:56:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:56:29,800 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:56:29,801 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:56:29,801 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521710918] [2021-06-05 08:56:29,801 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521710918] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:56:29,801 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:56:29,801 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 08:56:29,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111712226] [2021-06-05 08:56:29,801 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:56:29,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:56:29,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:56:29,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 08:56:29,801 INFO L87 Difference]: Start difference. First operand 110934 states and 334313 transitions. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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:56:31,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:56:31,351 INFO L93 Difference]: Finished difference Result 123400 states and 370799 transitions. [2021-06-05 08:56:31,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-05 08:56:31,351 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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 71 [2021-06-05 08:56:31,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:56:31,586 INFO L225 Difference]: With dead ends: 123400 [2021-06-05 08:56:31,586 INFO L226 Difference]: Without dead ends: 123400 [2021-06-05 08:56:31,587 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 436.0ms TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2021-06-05 08:56:31,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123400 states. [2021-06-05 08:56:33,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123400 to 111334. [2021-06-05 08:56:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111334 states, 111331 states have (on average 3.0133475851290297) internal successors, (335479), 111333 states have internal predecessors, (335479), 0 states have call successors, (0), 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:56:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111334 states to 111334 states and 335479 transitions. [2021-06-05 08:56:34,101 INFO L78 Accepts]: Start accepts. Automaton has 111334 states and 335479 transitions. Word has length 71 [2021-06-05 08:56:34,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:56:34,101 INFO L482 AbstractCegarLoop]: Abstraction has 111334 states and 335479 transitions. [2021-06-05 08:56:34,101 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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:56:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 111334 states and 335479 transitions. [2021-06-05 08:56:34,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:56:34,190 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:56:34,190 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, 1, 1, 1, 1] [2021-06-05 08:56:34,190 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186 [2021-06-05 08:56:34,190 INFO L430 AbstractCegarLoop]: === Iteration 26 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:56:34,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:56:34,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1812662315, now seen corresponding path program 9 times [2021-06-05 08:56:34,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:56:34,191 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451530505] [2021-06-05 08:56:34,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:56:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:56:34,427 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:56:34,427 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:56:34,427 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451530505] [2021-06-05 08:56:34,427 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451530505] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:56:34,427 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:56:34,427 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 08:56:34,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974129624] [2021-06-05 08:56:34,428 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 08:56:34,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:56:34,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 08:56:34,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:56:34,428 INFO L87 Difference]: Start difference. First operand 111334 states and 335479 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:56:36,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:56:36,680 INFO L93 Difference]: Finished difference Result 123310 states and 370523 transitions. [2021-06-05 08:56:36,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-05 08:56:36,681 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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 71 [2021-06-05 08:56:36,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:56:36,904 INFO L225 Difference]: With dead ends: 123310 [2021-06-05 08:56:36,904 INFO L226 Difference]: Without dead ends: 123310 [2021-06-05 08:56:36,904 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 813.0ms TimeCoverageRelationStatistics Valid=165, Invalid=765, Unknown=0, NotChecked=0, Total=930 [2021-06-05 08:56:37,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123310 states. [2021-06-05 08:56:38,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123310 to 111766. [2021-06-05 08:56:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111766 states, 111763 states have (on average 3.0129559872229628) internal successors, (336737), 111765 states have internal predecessors, (336737), 0 states have call successors, (0), 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:56:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111766 states to 111766 states and 336737 transitions. [2021-06-05 08:56:39,621 INFO L78 Accepts]: Start accepts. Automaton has 111766 states and 336737 transitions. Word has length 71 [2021-06-05 08:56:39,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:56:39,622 INFO L482 AbstractCegarLoop]: Abstraction has 111766 states and 336737 transitions. [2021-06-05 08:56:39,622 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:56:39,622 INFO L276 IsEmpty]: Start isEmpty. Operand 111766 states and 336737 transitions. [2021-06-05 08:56:39,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:56:39,729 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:56:39,730 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, 1, 1, 1, 1] [2021-06-05 08:56:39,730 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187 [2021-06-05 08:56:39,730 INFO L430 AbstractCegarLoop]: === Iteration 27 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:56:39,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:56:39,730 INFO L82 PathProgramCache]: Analyzing trace with hash -869743369, now seen corresponding path program 10 times [2021-06-05 08:56:39,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:56:39,730 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566047218] [2021-06-05 08:56:39,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:56:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:56:40,044 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:56:40,049 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:56:40,049 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566047218] [2021-06-05 08:56:40,049 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566047218] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:56:40,049 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:56:40,049 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 08:56:40,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53844376] [2021-06-05 08:56:40,050 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 08:56:40,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:56:40,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 08:56:40,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:56:40,051 INFO L87 Difference]: Start difference. First operand 111766 states and 336737 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:56:42,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:56:42,071 INFO L93 Difference]: Finished difference Result 123310 states and 370523 transitions. [2021-06-05 08:56:42,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 08:56:42,071 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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 71 [2021-06-05 08:56:42,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:56:42,269 INFO L225 Difference]: With dead ends: 123310 [2021-06-05 08:56:42,270 INFO L226 Difference]: Without dead ends: 123310 [2021-06-05 08:56:42,270 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 965.4ms TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2021-06-05 08:56:42,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123310 states. [2021-06-05 08:56:43,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123310 to 111254. [2021-06-05 08:56:44,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111254 states, 111251 states have (on average 3.0134470701386955) internal successors, (335249), 111253 states have internal predecessors, (335249), 0 states have call successors, (0), 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:56:44,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111254 states to 111254 states and 335249 transitions. [2021-06-05 08:56:44,333 INFO L78 Accepts]: Start accepts. Automaton has 111254 states and 335249 transitions. Word has length 71 [2021-06-05 08:56:44,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:56:44,334 INFO L482 AbstractCegarLoop]: Abstraction has 111254 states and 335249 transitions. [2021-06-05 08:56:44,334 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:56:44,334 INFO L276 IsEmpty]: Start isEmpty. Operand 111254 states and 335249 transitions. [2021-06-05 08:56:45,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:56:45,126 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:56:45,126 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, 1, 1, 1, 1] [2021-06-05 08:56:45,126 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188 [2021-06-05 08:56:45,126 INFO L430 AbstractCegarLoop]: === Iteration 28 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:56:45,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:56:45,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1972161191, now seen corresponding path program 11 times [2021-06-05 08:56:45,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:56:45,127 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520923002] [2021-06-05 08:56:45,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:56:45,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:56:45,589 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:56:45,589 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:56:45,589 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520923002] [2021-06-05 08:56:45,589 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520923002] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:56:45,589 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:56:45,590 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 08:56:45,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016071153] [2021-06-05 08:56:45,590 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:56:45,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:56:45,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:56:45,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-05 08:56:45,590 INFO L87 Difference]: Start difference. First operand 111254 states and 335249 transitions. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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:56:46,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:56:46,820 INFO L93 Difference]: Finished difference Result 123704 states and 371689 transitions. [2021-06-05 08:56:46,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 08:56:46,820 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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 71 [2021-06-05 08:56:46,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:56:47,036 INFO L225 Difference]: With dead ends: 123704 [2021-06-05 08:56:47,036 INFO L226 Difference]: Without dead ends: 123704 [2021-06-05 08:56:47,036 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 526.4ms TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2021-06-05 08:56:47,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123704 states. [2021-06-05 08:56:49,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123704 to 111478. [2021-06-05 08:56:49,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111478 states, 111475 states have (on average 3.0133124018838306) internal successors, (335909), 111477 states have internal predecessors, (335909), 0 states have call successors, (0), 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:56:49,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111478 states to 111478 states and 335909 transitions. [2021-06-05 08:56:49,507 INFO L78 Accepts]: Start accepts. Automaton has 111478 states and 335909 transitions. Word has length 71 [2021-06-05 08:56:49,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:56:49,508 INFO L482 AbstractCegarLoop]: Abstraction has 111478 states and 335909 transitions. [2021-06-05 08:56:49,508 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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:56:49,508 INFO L276 IsEmpty]: Start isEmpty. Operand 111478 states and 335909 transitions. [2021-06-05 08:56:49,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:56:49,602 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:56:49,602 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, 1, 1, 1, 1] [2021-06-05 08:56:49,602 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable189 [2021-06-05 08:56:49,602 INFO L430 AbstractCegarLoop]: === Iteration 29 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:56:49,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:56:49,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1838728183, now seen corresponding path program 12 times [2021-06-05 08:56:49,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:56:49,603 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175518057] [2021-06-05 08:56:49,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:56:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:56:49,810 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:56:49,810 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:56:49,810 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175518057] [2021-06-05 08:56:49,810 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175518057] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:56:49,811 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:56:49,811 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 08:56:49,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991843173] [2021-06-05 08:56:49,811 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 08:56:49,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:56:49,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 08:56:49,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:56:49,811 INFO L87 Difference]: Start difference. First operand 111478 states and 335909 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:56:51,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:56:51,559 INFO L93 Difference]: Finished difference Result 123086 states and 369879 transitions. [2021-06-05 08:56:51,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 08:56:51,560 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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 71 [2021-06-05 08:56:51,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:56:51,770 INFO L225 Difference]: With dead ends: 123086 [2021-06-05 08:56:51,770 INFO L226 Difference]: Without dead ends: 123086 [2021-06-05 08:56:51,770 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 611.4ms TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2021-06-05 08:56:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123086 states. [2021-06-05 08:56:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123086 to 111398. [2021-06-05 08:56:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111398 states, 111395 states have (on average 3.0134117330221284) internal successors, (335679), 111397 states have internal predecessors, (335679), 0 states have call successors, (0), 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:56:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111398 states to 111398 states and 335679 transitions. [2021-06-05 08:56:54,217 INFO L78 Accepts]: Start accepts. Automaton has 111398 states and 335679 transitions. Word has length 71 [2021-06-05 08:56:54,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:56:54,217 INFO L482 AbstractCegarLoop]: Abstraction has 111398 states and 335679 transitions. [2021-06-05 08:56:54,217 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:56:54,217 INFO L276 IsEmpty]: Start isEmpty. Operand 111398 states and 335679 transitions. [2021-06-05 08:56:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:56:54,309 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:56:54,309 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, 1, 1, 1, 1] [2021-06-05 08:56:54,309 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable190 [2021-06-05 08:56:54,310 INFO L430 AbstractCegarLoop]: === Iteration 30 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:56:54,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:56:54,310 INFO L82 PathProgramCache]: Analyzing trace with hash -379644169, now seen corresponding path program 13 times [2021-06-05 08:56:54,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:56:54,310 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485076959] [2021-06-05 08:56:54,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:56:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:56:54,472 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:56:54,473 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:56:54,473 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485076959] [2021-06-05 08:56:54,473 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485076959] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:56:54,473 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:56:54,473 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 08:56:54,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713925860] [2021-06-05 08:56:54,473 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:56:54,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:56:54,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:56:54,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 08:56:54,474 INFO L87 Difference]: Start difference. First operand 111398 states and 335679 transitions. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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:56:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:56:56,053 INFO L93 Difference]: Finished difference Result 123768 states and 371889 transitions. [2021-06-05 08:56:56,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 08:56:56,054 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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 71 [2021-06-05 08:56:56,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:56:56,271 INFO L225 Difference]: With dead ends: 123768 [2021-06-05 08:56:56,271 INFO L226 Difference]: Without dead ends: 123768 [2021-06-05 08:56:56,271 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 456.7ms TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:56:56,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123768 states. [2021-06-05 08:56:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123768 to 111542. [2021-06-05 08:56:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111542 states, 111539 states have (on average 3.013376487147993) internal successors, (336109), 111541 states have internal predecessors, (336109), 0 states have call successors, (0), 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:56:58,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111542 states to 111542 states and 336109 transitions. [2021-06-05 08:56:58,729 INFO L78 Accepts]: Start accepts. Automaton has 111542 states and 336109 transitions. Word has length 71 [2021-06-05 08:56:58,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:56:58,729 INFO L482 AbstractCegarLoop]: Abstraction has 111542 states and 336109 transitions. [2021-06-05 08:56:58,729 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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:56:58,729 INFO L276 IsEmpty]: Start isEmpty. Operand 111542 states and 336109 transitions. [2021-06-05 08:56:58,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:56:58,816 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:56:58,816 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, 1, 1, 1, 1] [2021-06-05 08:56:58,816 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191 [2021-06-05 08:56:58,816 INFO L430 AbstractCegarLoop]: === Iteration 31 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:56:58,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:56:58,817 INFO L82 PathProgramCache]: Analyzing trace with hash -863722091, now seen corresponding path program 14 times [2021-06-05 08:56:58,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:56:58,817 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158971005] [2021-06-05 08:56:58,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:56:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:56:59,047 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:56:59,047 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:56:59,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158971005] [2021-06-05 08:56:59,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158971005] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:56:59,047 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:56:59,047 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 08:56:59,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222704071] [2021-06-05 08:56:59,047 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 08:56:59,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:56:59,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 08:56:59,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:56:59,048 INFO L87 Difference]: Start difference. First operand 111542 states and 336109 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:57:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:00,971 INFO L93 Difference]: Finished difference Result 125351 states and 376466 transitions. [2021-06-05 08:57:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 08:57:00,972 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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 71 [2021-06-05 08:57:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:01,189 INFO L225 Difference]: With dead ends: 125351 [2021-06-05 08:57:01,189 INFO L226 Difference]: Without dead ends: 125351 [2021-06-05 08:57:01,189 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 767.7ms TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:57:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125351 states. [2021-06-05 08:57:02,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125351 to 111318. [2021-06-05 08:57:03,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111318 states, 111315 states have (on average 3.0135112069352736) internal successors, (335449), 111317 states have internal predecessors, (335449), 0 states have call successors, (0), 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:57:03,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111318 states to 111318 states and 335449 transitions. [2021-06-05 08:57:03,671 INFO L78 Accepts]: Start accepts. Automaton has 111318 states and 335449 transitions. Word has length 71 [2021-06-05 08:57:03,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:03,671 INFO L482 AbstractCegarLoop]: Abstraction has 111318 states and 335449 transitions. [2021-06-05 08:57:03,672 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:57:03,672 INFO L276 IsEmpty]: Start isEmpty. Operand 111318 states and 335449 transitions. [2021-06-05 08:57:03,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:57:03,757 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:03,757 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, 1, 1, 1, 1] [2021-06-05 08:57:03,758 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192 [2021-06-05 08:57:03,758 INFO L430 AbstractCegarLoop]: === Iteration 32 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:03,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:03,758 INFO L82 PathProgramCache]: Analyzing trace with hash -888667047, now seen corresponding path program 15 times [2021-06-05 08:57:03,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:03,758 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390558986] [2021-06-05 08:57:03,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:03,939 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:57:03,939 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:03,939 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390558986] [2021-06-05 08:57:03,939 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390558986] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:57:03,939 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:57:03,939 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-05 08:57:03,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303811551] [2021-06-05 08:57:03,940 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 08:57:03,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:03,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 08:57:03,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-05 08:57:03,940 INFO L87 Difference]: Start difference. First operand 111318 states and 335449 transitions. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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:57:05,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:05,885 INFO L93 Difference]: Finished difference Result 134894 states and 405287 transitions. [2021-06-05 08:57:05,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 08:57:05,885 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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 71 [2021-06-05 08:57:05,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:06,103 INFO L225 Difference]: With dead ends: 134894 [2021-06-05 08:57:06,103 INFO L226 Difference]: Without dead ends: 134894 [2021-06-05 08:57:06,104 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 609.5ms TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2021-06-05 08:57:06,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134894 states. [2021-06-05 08:57:08,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134894 to 113021. [2021-06-05 08:57:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113021 states, 113018 states have (on average 3.0122369887982443) internal successors, (340437), 113020 states have internal predecessors, (340437), 0 states have call successors, (0), 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:57:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113021 states to 113021 states and 340437 transitions. [2021-06-05 08:57:08,706 INFO L78 Accepts]: Start accepts. Automaton has 113021 states and 340437 transitions. Word has length 71 [2021-06-05 08:57:08,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:08,707 INFO L482 AbstractCegarLoop]: Abstraction has 113021 states and 340437 transitions. [2021-06-05 08:57:08,707 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 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:57:08,707 INFO L276 IsEmpty]: Start isEmpty. Operand 113021 states and 340437 transitions. [2021-06-05 08:57:08,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:57:08,794 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:08,794 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, 1, 1, 1, 1] [2021-06-05 08:57:08,794 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193 [2021-06-05 08:57:08,794 INFO L430 AbstractCegarLoop]: === Iteration 33 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:08,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:08,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1372744969, now seen corresponding path program 16 times [2021-06-05 08:57:08,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:08,795 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095341985] [2021-06-05 08:57:08,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:09,009 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:57:09,009 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:09,009 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095341985] [2021-06-05 08:57:09,009 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095341985] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:57:09,009 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:57:09,009 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 08:57:09,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41365641] [2021-06-05 08:57:09,010 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 08:57:09,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:09,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 08:57:09,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:57:09,010 INFO L87 Difference]: Start difference. First operand 113021 states and 340437 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:57:10,875 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2021-06-05 08:57:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:11,219 INFO L93 Difference]: Finished difference Result 132910 states and 399255 transitions. [2021-06-05 08:57:11,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 08:57:11,220 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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 71 [2021-06-05 08:57:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:11,453 INFO L225 Difference]: With dead ends: 132910 [2021-06-05 08:57:11,453 INFO L226 Difference]: Without dead ends: 132910 [2021-06-05 08:57:11,454 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1270.3ms TimeCoverageRelationStatistics Valid=239, Invalid=1021, Unknown=0, NotChecked=0, Total=1260 [2021-06-05 08:57:11,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132910 states. [2021-06-05 08:57:13,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132910 to 112509. [2021-06-05 08:57:13,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112509 states, 112506 states have (on average 3.0125771069987377) internal successors, (338933), 112508 states have internal predecessors, (338933), 0 states have call successors, (0), 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:57:14,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112509 states to 112509 states and 338933 transitions. [2021-06-05 08:57:14,008 INFO L78 Accepts]: Start accepts. Automaton has 112509 states and 338933 transitions. Word has length 71 [2021-06-05 08:57:14,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:14,008 INFO L482 AbstractCegarLoop]: Abstraction has 112509 states and 338933 transitions. [2021-06-05 08:57:14,009 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:57:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 112509 states and 338933 transitions. [2021-06-05 08:57:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:57:14,095 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:14,095 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, 1, 1, 1, 1] [2021-06-05 08:57:14,095 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194 [2021-06-05 08:57:14,095 INFO L430 AbstractCegarLoop]: === Iteration 34 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:14,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:14,095 INFO L82 PathProgramCache]: Analyzing trace with hash -617899509, now seen corresponding path program 17 times [2021-06-05 08:57:14,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:14,095 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756649910] [2021-06-05 08:57:14,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:57:14,292 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:14,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756649910] [2021-06-05 08:57:14,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756649910] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:57:14,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351595291] [2021-06-05 08:57:14,292 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 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:57:14,363 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 08:57:14,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:57:14,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 56 conjunts are in the unsatisfiable core [2021-06-05 08:57:14,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:57:14,454 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:57:14,455 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:14,460 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:14,461 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:14,461 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-06-05 08:57:14,548 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:57:14,549 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:57:14,549 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:14,567 INFO L354 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2021-06-05 08:57:14,567 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 43 treesize of output 25 [2021-06-05 08:57:14,568 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:14,585 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:14,586 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 08:57:14,587 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:53 [2021-06-05 08:57:14,740 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:57:14,741 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:57:14,742 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:14,747 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:14,749 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:57:14,749 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:22 [2021-06-05 08:57:14,870 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:57:14,870 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:14,874 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:57:14,875 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:57:14,880 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:14,884 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:14,885 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:57:14,885 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2021-06-05 08:57:14,904 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:57:14,904 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351595291] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:57:14,904 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:57:14,904 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [18] total 29 [2021-06-05 08:57:14,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495538343] [2021-06-05 08:57:14,905 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:57:14,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:14,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:57:14,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2021-06-05 08:57:14,905 INFO L87 Difference]: Start difference. First operand 112509 states and 338933 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 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:57:16,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:16,396 INFO L93 Difference]: Finished difference Result 124894 states and 374830 transitions. [2021-06-05 08:57:16,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 08:57:16,396 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 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 71 [2021-06-05 08:57:16,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:16,618 INFO L225 Difference]: With dead ends: 124894 [2021-06-05 08:57:16,618 INFO L226 Difference]: Without dead ends: 124894 [2021-06-05 08:57:16,619 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 755.2ms TimeCoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2021-06-05 08:57:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124894 states. [2021-06-05 08:57:18,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124894 to 113086. [2021-06-05 08:57:18,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113086 states, 113083 states have (on average 3.0123095425483934) internal successors, (340641), 113085 states have internal predecessors, (340641), 0 states have call successors, (0), 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:57:19,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113086 states to 113086 states and 340641 transitions. [2021-06-05 08:57:19,149 INFO L78 Accepts]: Start accepts. Automaton has 113086 states and 340641 transitions. Word has length 71 [2021-06-05 08:57:19,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:19,149 INFO L482 AbstractCegarLoop]: Abstraction has 113086 states and 340641 transitions. [2021-06-05 08:57:19,149 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 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:57:19,149 INFO L276 IsEmpty]: Start isEmpty. Operand 113086 states and 340641 transitions. [2021-06-05 08:57:19,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:57:19,234 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:19,234 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, 1, 1, 1, 1] [2021-06-05 08:57:19,435 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:57:19,435 INFO L430 AbstractCegarLoop]: === Iteration 35 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:19,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:19,435 INFO L82 PathProgramCache]: Analyzing trace with hash 576595955, now seen corresponding path program 18 times [2021-06-05 08:57:19,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:19,436 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009889688] [2021-06-05 08:57:19,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:19,562 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:57:19,563 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:19,563 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009889688] [2021-06-05 08:57:19,563 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009889688] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:57:19,563 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:57:19,563 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 08:57:19,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027278174] [2021-06-05 08:57:19,563 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 08:57:19,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:19,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 08:57:19,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:57:19,563 INFO L87 Difference]: Start difference. First operand 113086 states and 340641 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:57:20,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:20,678 INFO L93 Difference]: Finished difference Result 163494 states and 490430 transitions. [2021-06-05 08:57:20,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 08:57:20,678 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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 71 [2021-06-05 08:57:20,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:21,323 INFO L225 Difference]: With dead ends: 163494 [2021-06-05 08:57:21,323 INFO L226 Difference]: Without dead ends: 163494 [2021-06-05 08:57:21,324 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 171.6ms TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2021-06-05 08:57:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163494 states. [2021-06-05 08:57:23,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163494 to 116690. [2021-06-05 08:57:23,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116690 states, 116687 states have (on average 3.0156658410962662) internal successors, (351889), 116689 states have internal predecessors, (351889), 0 states have call successors, (0), 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:57:24,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116690 states to 116690 states and 351889 transitions. [2021-06-05 08:57:24,071 INFO L78 Accepts]: Start accepts. Automaton has 116690 states and 351889 transitions. Word has length 71 [2021-06-05 08:57:24,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:24,071 INFO L482 AbstractCegarLoop]: Abstraction has 116690 states and 351889 transitions. [2021-06-05 08:57:24,071 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:57:24,071 INFO L276 IsEmpty]: Start isEmpty. Operand 116690 states and 351889 transitions. [2021-06-05 08:57:24,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:57:24,164 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:24,165 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, 1, 1, 1, 1] [2021-06-05 08:57:24,165 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207 [2021-06-05 08:57:24,165 INFO L430 AbstractCegarLoop]: === Iteration 36 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:24,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:24,165 INFO L82 PathProgramCache]: Analyzing trace with hash -511811637, now seen corresponding path program 19 times [2021-06-05 08:57:24,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:24,165 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908494292] [2021-06-05 08:57:24,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 08:57:24,328 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:24,328 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908494292] [2021-06-05 08:57:24,328 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908494292] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:57:24,328 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57858745] [2021-06-05 08:57:24,328 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 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:57:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:24,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 54 conjunts are in the unsatisfiable core [2021-06-05 08:57:24,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:57:24,501 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:57:24,502 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:24,509 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:24,509 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:24,509 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2021-06-05 08:57:24,590 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:57:24,590 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:57:24,591 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:24,609 INFO L354 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2021-06-05 08:57:24,609 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 43 treesize of output 25 [2021-06-05 08:57:24,610 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:24,630 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:24,631 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 08:57:24,631 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:55 [2021-06-05 08:57:24,772 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:57:24,772 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:57:24,773 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:24,779 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:24,781 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:57:24,782 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:22 [2021-06-05 08:57:24,900 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:57:24,901 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:24,906 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:57:24,906 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:57:24,907 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:24,912 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:24,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:57:24,913 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2021-06-05 08:57:24,934 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:57:24,934 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57858745] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:57:24,934 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 08:57:24,934 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 28 [2021-06-05 08:57:24,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269696256] [2021-06-05 08:57:24,935 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 08:57:24,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:24,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 08:57:24,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2021-06-05 08:57:24,935 INFO L87 Difference]: Start difference. First operand 116690 states and 351889 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 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:57:26,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:26,313 INFO L93 Difference]: Finished difference Result 124392 states and 374259 transitions. [2021-06-05 08:57:26,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 08:57:26,313 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 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 71 [2021-06-05 08:57:26,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:26,512 INFO L225 Difference]: With dead ends: 124392 [2021-06-05 08:57:26,512 INFO L226 Difference]: Without dead ends: 124392 [2021-06-05 08:57:26,512 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 644.9ms TimeCoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2021-06-05 08:57:26,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124392 states. [2021-06-05 08:57:28,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124392 to 116738. [2021-06-05 08:57:28,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116738 states, 116735 states have (on average 3.0157450636056025) internal successors, (352043), 116737 states have internal predecessors, (352043), 0 states have call successors, (0), 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:57:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116738 states to 116738 states and 352043 transitions. [2021-06-05 08:57:28,601 INFO L78 Accepts]: Start accepts. Automaton has 116738 states and 352043 transitions. Word has length 71 [2021-06-05 08:57:28,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:28,601 INFO L482 AbstractCegarLoop]: Abstraction has 116738 states and 352043 transitions. [2021-06-05 08:57:28,601 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 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:57:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 116738 states and 352043 transitions. [2021-06-05 08:57:28,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:57:28,703 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:28,703 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, 1, 1, 1, 1] [2021-06-05 08:57:28,903 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable208 [2021-06-05 08:57:28,903 INFO L430 AbstractCegarLoop]: === Iteration 37 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:28,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:28,904 INFO L82 PathProgramCache]: Analyzing trace with hash 5020801, now seen corresponding path program 7 times [2021-06-05 08:57:28,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:28,904 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260388484] [2021-06-05 08:57:28,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:29,032 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:57:29,032 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:29,032 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260388484] [2021-06-05 08:57:29,033 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260388484] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:57:29,033 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:57:29,033 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 08:57:29,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520852560] [2021-06-05 08:57:29,033 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 08:57:29,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:29,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 08:57:29,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:57:29,033 INFO L87 Difference]: Start difference. First operand 116738 states and 352043 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:57:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:30,607 INFO L93 Difference]: Finished difference Result 143426 states and 430537 transitions. [2021-06-05 08:57:30,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 08:57:30,608 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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 71 [2021-06-05 08:57:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:30,853 INFO L225 Difference]: With dead ends: 143426 [2021-06-05 08:57:30,853 INFO L226 Difference]: Without dead ends: 143426 [2021-06-05 08:57:30,854 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 269.3ms TimeCoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2021-06-05 08:57:31,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143426 states. [2021-06-05 08:57:32,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143426 to 116472. [2021-06-05 08:57:33,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116472 states, 116469 states have (on average 3.013754733019087) internal successors, (351009), 116471 states have internal predecessors, (351009), 0 states have call successors, (0), 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:57:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116472 states to 116472 states and 351009 transitions. [2021-06-05 08:57:33,373 INFO L78 Accepts]: Start accepts. Automaton has 116472 states and 351009 transitions. Word has length 71 [2021-06-05 08:57:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:33,373 INFO L482 AbstractCegarLoop]: Abstraction has 116472 states and 351009 transitions. [2021-06-05 08:57:33,373 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:57:33,373 INFO L276 IsEmpty]: Start isEmpty. Operand 116472 states and 351009 transitions. [2021-06-05 08:57:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:57:33,478 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:33,478 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, 1, 1, 1, 1] [2021-06-05 08:57:33,479 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220 [2021-06-05 08:57:33,479 INFO L430 AbstractCegarLoop]: === Iteration 38 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:33,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:33,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1257485091, now seen corresponding path program 8 times [2021-06-05 08:57:33,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:33,479 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003845471] [2021-06-05 08:57:33,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:33,699 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:57:33,700 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:33,700 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003845471] [2021-06-05 08:57:33,700 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003845471] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:57:33,700 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:57:33,700 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-05 08:57:33,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659894879] [2021-06-05 08:57:33,700 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-05 08:57:33,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:33,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-05 08:57:33,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-05 08:57:33,701 INFO L87 Difference]: Start difference. First operand 116472 states and 351009 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 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:57:34,554 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-06-05 08:57:35,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:35,443 INFO L93 Difference]: Finished difference Result 134020 states and 402732 transitions. [2021-06-05 08:57:35,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 08:57:35,444 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 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 71 [2021-06-05 08:57:35,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:35,684 INFO L225 Difference]: With dead ends: 134020 [2021-06-05 08:57:35,684 INFO L226 Difference]: Without dead ends: 134020 [2021-06-05 08:57:35,684 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 798.2ms TimeCoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 08:57:36,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134020 states. [2021-06-05 08:57:37,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134020 to 116808. [2021-06-05 08:57:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116808 states, 116805 states have (on average 3.0131672445528874) internal successors, (351953), 116807 states have internal predecessors, (351953), 0 states have call successors, (0), 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:57:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116808 states to 116808 states and 351953 transitions. [2021-06-05 08:57:38,288 INFO L78 Accepts]: Start accepts. Automaton has 116808 states and 351953 transitions. Word has length 71 [2021-06-05 08:57:38,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:38,288 INFO L482 AbstractCegarLoop]: Abstraction has 116808 states and 351953 transitions. [2021-06-05 08:57:38,289 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 18 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:57:38,289 INFO L276 IsEmpty]: Start isEmpty. Operand 116808 states and 351953 transitions. [2021-06-05 08:57:38,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:57:38,389 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:38,389 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, 1, 1, 1, 1] [2021-06-05 08:57:38,389 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221 [2021-06-05 08:57:38,389 INFO L430 AbstractCegarLoop]: === Iteration 39 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:38,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:38,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1437161651, now seen corresponding path program 20 times [2021-06-05 08:57:38,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:38,390 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210303778] [2021-06-05 08:57:38,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:38,505 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:57:38,505 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:38,505 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210303778] [2021-06-05 08:57:38,505 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210303778] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:57:38,505 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:57:38,505 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-06-05 08:57:38,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510300804] [2021-06-05 08:57:38,506 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 08:57:38,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:38,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 08:57:38,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-06-05 08:57:38,506 INFO L87 Difference]: Start difference. First operand 116808 states and 351953 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:57:40,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:40,062 INFO L93 Difference]: Finished difference Result 163418 states and 490749 transitions. [2021-06-05 08:57:40,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 08:57:40,062 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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 71 [2021-06-05 08:57:40,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:40,353 INFO L225 Difference]: With dead ends: 163418 [2021-06-05 08:57:40,353 INFO L226 Difference]: Without dead ends: 163418 [2021-06-05 08:57:40,353 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 150.5ms TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2021-06-05 08:57:40,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163418 states. [2021-06-05 08:57:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163418 to 116808. [2021-06-05 08:57:43,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116808 states, 116805 states have (on average 3.0131672445528874) internal successors, (351953), 116807 states have internal predecessors, (351953), 0 states have call successors, (0), 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:57:43,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116808 states to 116808 states and 351953 transitions. [2021-06-05 08:57:43,415 INFO L78 Accepts]: Start accepts. Automaton has 116808 states and 351953 transitions. Word has length 71 [2021-06-05 08:57:43,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:43,415 INFO L482 AbstractCegarLoop]: Abstraction has 116808 states and 351953 transitions. [2021-06-05 08:57:43,416 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 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:57:43,416 INFO L276 IsEmpty]: Start isEmpty. Operand 116808 states and 351953 transitions. [2021-06-05 08:57:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:57:43,525 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:43,526 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, 1, 1, 1, 1] [2021-06-05 08:57:43,526 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable222 [2021-06-05 08:57:43,526 INFO L430 AbstractCegarLoop]: === Iteration 40 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:43,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:43,526 INFO L82 PathProgramCache]: Analyzing trace with hash 519540029, now seen corresponding path program 21 times [2021-06-05 08:57:43,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:43,526 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017670436] [2021-06-05 08:57:43,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:44,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:57:44,021 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:44,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017670436] [2021-06-05 08:57:44,021 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017670436] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:57:44,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156347548] [2021-06-05 08:57:44,021 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 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:57:44,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:57:44,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:57:44,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 58 conjunts are in the unsatisfiable core [2021-06-05 08:57:44,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:57:44,157 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:57:44,157 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,161 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:44,161 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,161 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:57:44,223 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:57:44,223 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:57:44,225 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,229 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:44,229 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,230 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-06-05 08:57:44,272 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:57:44,273 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,280 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:44,281 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,281 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2021-06-05 08:57:44,319 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:57:44,320 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,328 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:44,329 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:57:44,329 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:20 [2021-06-05 08:57:44,406 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:57:44,406 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:57:44,407 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,414 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:44,434 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:57:44,434 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:28 [2021-06-05 08:57:44,580 INFO L446 ElimStorePlain]: Different costs {4=[v_prenex_44], 9=[v_prenex_47, |v_#memory_int_138|]} [2021-06-05 08:57:44,613 INFO L354 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2021-06-05 08:57:44,613 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 43 treesize of output 33 [2021-06-05 08:57:44,614 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,655 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:44,690 INFO L354 Elim1Store]: treesize reduction 81, result has 28.9 percent of original size [2021-06-05 08:57:44,690 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 4 case distinctions, treesize of input 50 treesize of output 46 [2021-06-05 08:57:44,692 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,728 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:44,740 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:57:44,741 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:57:44,741 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,763 INFO L354 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2021-06-05 08:57:44,764 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 3 case distinctions, treesize of input 26 treesize of output 40 [2021-06-05 08:57:44,765 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:44,805 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:44,828 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 08:57:44,828 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:163, output treesize:126 [2021-06-05 08:57:45,052 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_51], 1=[|#memory_int|]} [2021-06-05 08:57:45,054 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:57:45,055 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:45,060 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:45,064 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:57:45,064 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:57:45,066 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:45,069 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:45,070 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:57:45,070 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:7 [2021-06-05 08:57:45,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:57:45,094 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156347548] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:57:45,094 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:57:45,094 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2021-06-05 08:57:45,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122704642] [2021-06-05 08:57:45,094 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 08:57:45,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:45,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 08:57:45,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2021-06-05 08:57:45,095 INFO L87 Difference]: Start difference. First operand 116808 states and 351953 transitions. Second operand has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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:57:48,151 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2021-06-05 08:57:51,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:57:51,877 INFO L93 Difference]: Finished difference Result 199049 states and 596682 transitions. [2021-06-05 08:57:51,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-06-05 08:57:51,878 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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 71 [2021-06-05 08:57:51,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:57:52,273 INFO L225 Difference]: With dead ends: 199049 [2021-06-05 08:57:52,273 INFO L226 Difference]: Without dead ends: 199049 [2021-06-05 08:57:52,274 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 3694.0ms TimeCoverageRelationStatistics Valid=677, Invalid=5485, Unknown=0, NotChecked=0, Total=6162 [2021-06-05 08:57:52,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199049 states. [2021-06-05 08:57:54,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199049 to 121799. [2021-06-05 08:57:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121799 states, 121796 states have (on average 3.0147870209202274) internal successors, (367189), 121798 states have internal predecessors, (367189), 0 states have call successors, (0), 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:57:55,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121799 states to 121799 states and 367189 transitions. [2021-06-05 08:57:55,259 INFO L78 Accepts]: Start accepts. Automaton has 121799 states and 367189 transitions. Word has length 71 [2021-06-05 08:57:55,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:57:55,259 INFO L482 AbstractCegarLoop]: Abstraction has 121799 states and 367189 transitions. [2021-06-05 08:57:55,260 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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:57:55,260 INFO L276 IsEmpty]: Start isEmpty. Operand 121799 states and 367189 transitions. [2021-06-05 08:57:55,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:57:55,364 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:57:55,364 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, 1, 1, 1, 1] [2021-06-05 08:57:55,568 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable223 [2021-06-05 08:57:55,569 INFO L430 AbstractCegarLoop]: === Iteration 41 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:57:55,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:57:55,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1603677659, now seen corresponding path program 22 times [2021-06-05 08:57:55,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:57:55,569 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422925549] [2021-06-05 08:57:55,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:57:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:57:56,356 WARN L205 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2021-06-05 08:57:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:57:56,412 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:57:56,412 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422925549] [2021-06-05 08:57:56,413 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422925549] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:57:56,413 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399144986] [2021-06-05 08:57:56,413 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 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:57:56,547 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:57:56,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:57:56,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 58 conjunts are in the unsatisfiable core [2021-06-05 08:57:56,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:57:56,594 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:57:56,595 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:56,598 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:56,599 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:56,599 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:57:56,642 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:57:56,642 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:57:56,643 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:56,647 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:56,648 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:56,648 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-06-05 08:57:56,690 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:57:56,691 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:56,697 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:56,698 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:57:56,698 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2021-06-05 08:57:56,727 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:57:56,728 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:56,736 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:56,737 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:57:56,737 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:20 [2021-06-05 08:57:56,858 INFO L354 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2021-06-05 08:57:56,858 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 43 treesize of output 25 [2021-06-05 08:57:56,859 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:56,874 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:57:56,874 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:57:56,875 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:56,895 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:56,897 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 08:57:56,897 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:59 [2021-06-05 08:57:57,061 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:57:57,061 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:57:57,062 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:57,067 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:57,069 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:57:57,069 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:22 [2021-06-05 08:57:57,182 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:57:57,182 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:57,187 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:57:57,187 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:57:57,188 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:57:57,192 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:57:57,193 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:57:57,193 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2021-06-05 08:57:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:57:57,215 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399144986] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:57:57,216 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:57:57,216 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2021-06-05 08:57:57,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468902261] [2021-06-05 08:57:57,216 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 08:57:57,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:57:57,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 08:57:57,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2021-06-05 08:57:57,216 INFO L87 Difference]: Start difference. First operand 121799 states and 367189 transitions. Second operand has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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:58:00,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:00,925 INFO L93 Difference]: Finished difference Result 142312 states and 427114 transitions. [2021-06-05 08:58:00,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-05 08:58:00,925 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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 71 [2021-06-05 08:58:00,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:01,168 INFO L225 Difference]: With dead ends: 142312 [2021-06-05 08:58:01,168 INFO L226 Difference]: Without dead ends: 142312 [2021-06-05 08:58:01,168 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 2841.9ms TimeCoverageRelationStatistics Valid=525, Invalid=3135, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 08:58:01,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142312 states. [2021-06-05 08:58:03,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142312 to 122335. [2021-06-05 08:58:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122335 states, 122332 states have (on average 3.014493345976523) internal successors, (368769), 122334 states have internal predecessors, (368769), 0 states have call successors, (0), 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:58:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122335 states to 122335 states and 368769 transitions. [2021-06-05 08:58:03,606 INFO L78 Accepts]: Start accepts. Automaton has 122335 states and 368769 transitions. Word has length 71 [2021-06-05 08:58:03,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:03,606 INFO L482 AbstractCegarLoop]: Abstraction has 122335 states and 368769 transitions. [2021-06-05 08:58:03,606 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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:58:03,606 INFO L276 IsEmpty]: Start isEmpty. Operand 122335 states and 368769 transitions. [2021-06-05 08:58:03,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:58:03,710 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:03,710 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, 1, 1, 1, 1] [2021-06-05 08:58:03,912 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:03,913 INFO L430 AbstractCegarLoop]: === Iteration 42 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:03,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:03,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1822018213, now seen corresponding path program 23 times [2021-06-05 08:58:03,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:03,913 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637009606] [2021-06-05 08:58:03,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:04,100 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:04,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637009606] [2021-06-05 08:58:04,100 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637009606] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:04,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494728742] [2021-06-05 08:58:04,100 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 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:58:04,174 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 08:58:04,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:58:04,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 60 conjunts are in the unsatisfiable core [2021-06-05 08:58:04,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:58:04,194 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:58:04,194 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:04,198 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:04,198 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:04,198 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:58:04,227 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:58:04,227 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:58:04,229 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:04,233 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:04,233 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:04,233 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-06-05 08:58:04,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:58:04,273 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:04,280 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:04,281 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:04,281 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2021-06-05 08:58:04,314 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:58:04,315 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:04,679 WARN L205 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-06-05 08:58:04,679 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:04,680 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:58:04,680 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:20 [2021-06-05 08:58:04,831 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:58:04,831 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:58:04,832 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:04,848 INFO L354 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2021-06-05 08:58:04,849 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 43 treesize of output 25 [2021-06-05 08:58:04,850 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:04,871 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:04,872 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 08:58:04,872 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:55 [2021-06-05 08:58:05,024 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:58:05,025 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:58:05,025 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:05,031 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:05,033 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:58:05,033 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:22 [2021-06-05 08:58:05,127 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:58:05,128 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:05,132 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:58:05,133 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:58:05,134 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:05,138 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:05,138 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:58:05,139 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2021-06-05 08:58:05,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:05,158 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494728742] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:05,158 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:58:05,159 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 29 [2021-06-05 08:58:05,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048830197] [2021-06-05 08:58:05,159 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 08:58:05,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:05,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 08:58:05,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2021-06-05 08:58:05,159 INFO L87 Difference]: Start difference. First operand 122335 states and 368769 transitions. Second operand has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 29 states have internal predecessors, (107), 0 states have call successors, (0), 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:58:07,564 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2021-06-05 08:58:08,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:08,775 INFO L93 Difference]: Finished difference Result 166977 states and 499959 transitions. [2021-06-05 08:58:08,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-06-05 08:58:08,775 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 29 states have internal predecessors, (107), 0 states have call successors, (0), 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 71 [2021-06-05 08:58:08,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:09,079 INFO L225 Difference]: With dead ends: 166977 [2021-06-05 08:58:09,080 INFO L226 Difference]: Without dead ends: 166977 [2021-06-05 08:58:09,080 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1191 ImplicationChecksByTransitivity, 2126.0ms TimeCoverageRelationStatistics Valid=555, Invalid=3735, Unknown=0, NotChecked=0, Total=4290 [2021-06-05 08:58:09,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166977 states. [2021-06-05 08:58:11,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166977 to 123842. [2021-06-05 08:58:11,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123842 states, 123839 states have (on average 3.0135337010150276) internal successors, (373193), 123841 states have internal predecessors, (373193), 0 states have call successors, (0), 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:58:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123842 states to 123842 states and 373193 transitions. [2021-06-05 08:58:11,804 INFO L78 Accepts]: Start accepts. Automaton has 123842 states and 373193 transitions. Word has length 71 [2021-06-05 08:58:11,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:11,804 INFO L482 AbstractCegarLoop]: Abstraction has 123842 states and 373193 transitions. [2021-06-05 08:58:11,805 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 29 states have internal predecessors, (107), 0 states have call successors, (0), 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:58:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 123842 states and 373193 transitions. [2021-06-05 08:58:11,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:58:11,915 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:11,915 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, 1, 1, 1, 1] [2021-06-05 08:58:12,116 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable264,24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:12,116 INFO L430 AbstractCegarLoop]: === Iteration 43 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:12,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:12,116 INFO L82 PathProgramCache]: Analyzing trace with hash 262678905, now seen corresponding path program 24 times [2021-06-05 08:58:12,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:12,116 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818358386] [2021-06-05 08:58:12,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:12,308 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:12,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818358386] [2021-06-05 08:58:12,308 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818358386] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:12,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819474579] [2021-06-05 08:58:12,308 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 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:58:12,381 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 08:58:12,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:58:12,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 63 conjunts are in the unsatisfiable core [2021-06-05 08:58:12,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:58:12,400 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:58:12,401 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:12,404 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:12,405 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:12,405 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:58:12,435 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:58:12,435 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:58:12,436 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:12,441 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:12,441 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:12,441 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-06-05 08:58:12,481 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:58:12,481 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:12,488 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:12,488 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:12,489 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2021-06-05 08:58:12,518 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:58:12,518 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:12,526 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:12,527 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:58:12,528 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:20 [2021-06-05 08:58:13,080 WARN L205 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2021-06-05 08:58:13,136 INFO L354 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2021-06-05 08:58:13,136 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 43 treesize of output 25 [2021-06-05 08:58:13,137 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:13,143 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:13,144 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:58:13,144 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:32 [2021-06-05 08:58:13,273 INFO L354 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2021-06-05 08:58:13,274 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 3 case distinctions, treesize of input 30 treesize of output 36 [2021-06-05 08:58:13,275 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:13,282 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:13,286 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:58:13,287 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2021-06-05 08:58:13,397 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:58:13,398 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:13,402 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:58:13,402 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:58:13,403 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:13,407 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:13,408 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:58:13,408 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2021-06-05 08:58:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:13,428 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819474579] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:13,428 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:58:13,428 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 29 [2021-06-05 08:58:13,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858533543] [2021-06-05 08:58:13,428 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 08:58:13,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:13,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 08:58:13,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=713, Unknown=0, NotChecked=0, Total=812 [2021-06-05 08:58:13,429 INFO L87 Difference]: Start difference. First operand 123842 states and 373193 transitions. Second operand has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 29 states have internal predecessors, (107), 0 states have call successors, (0), 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:58:15,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:15,737 INFO L93 Difference]: Finished difference Result 164630 states and 492738 transitions. [2021-06-05 08:58:15,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 08:58:15,738 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 29 states have internal predecessors, (107), 0 states have call successors, (0), 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 71 [2021-06-05 08:58:15,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:16,004 INFO L225 Difference]: With dead ends: 164630 [2021-06-05 08:58:16,004 INFO L226 Difference]: Without dead ends: 164630 [2021-06-05 08:58:16,004 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 780.8ms TimeCoverageRelationStatistics Valid=366, Invalid=2184, Unknown=0, NotChecked=0, Total=2550 [2021-06-05 08:58:16,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164630 states. [2021-06-05 08:58:18,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164630 to 123234. [2021-06-05 08:58:18,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123234 states, 123231 states have (on average 3.0141847424755133) internal successors, (371441), 123233 states have internal predecessors, (371441), 0 states have call successors, (0), 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:58:18,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123234 states to 123234 states and 371441 transitions. [2021-06-05 08:58:18,852 INFO L78 Accepts]: Start accepts. Automaton has 123234 states and 371441 transitions. Word has length 71 [2021-06-05 08:58:18,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:18,852 INFO L482 AbstractCegarLoop]: Abstraction has 123234 states and 371441 transitions. [2021-06-05 08:58:18,852 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 29 states have internal predecessors, (107), 0 states have call successors, (0), 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:58:18,852 INFO L276 IsEmpty]: Start isEmpty. Operand 123234 states and 371441 transitions. [2021-06-05 08:58:18,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:58:18,949 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:18,949 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, 1, 1, 1, 1] [2021-06-05 08:58:19,149 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable275,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:19,149 INFO L430 AbstractCegarLoop]: === Iteration 44 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:19,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:19,150 INFO L82 PathProgramCache]: Analyzing trace with hash 31956643, now seen corresponding path program 25 times [2021-06-05 08:58:19,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:19,150 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541037049] [2021-06-05 08:58:19,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:19,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:19,288 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:19,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541037049] [2021-06-05 08:58:19,288 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541037049] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:19,288 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319783637] [2021-06-05 08:58:19,288 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 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:58:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:19,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 53 conjunts are in the unsatisfiable core [2021-06-05 08:58:19,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:58:19,388 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:58:19,389 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:19,392 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:19,392 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:19,392 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:58:19,422 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:58:19,422 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:58:19,423 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:19,427 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:19,428 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:19,428 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-06-05 08:58:19,465 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:58:19,466 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:19,471 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:19,472 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:19,472 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 08:58:19,506 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:58:19,507 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:19,515 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:19,516 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:58:19,516 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2021-06-05 08:58:19,562 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:58:19,563 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:19,566 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:19,566 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:58:19,566 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2021-06-05 08:58:19,598 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-06-05 08:58:19,598 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 15 [2021-06-05 08:58:19,599 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:19,610 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:19,613 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:58:19,613 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:19,623 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:19,624 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:58:19,624 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:36 [2021-06-05 08:58:19,725 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:58:19,726 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:19,727 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:19,727 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:58:19,727 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 08:58:19,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:19,742 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319783637] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:19,742 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:58:19,742 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 25 [2021-06-05 08:58:19,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251042644] [2021-06-05 08:58:19,743 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 08:58:19,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:19,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 08:58:19,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2021-06-05 08:58:19,743 INFO L87 Difference]: Start difference. First operand 123234 states and 371441 transitions. Second operand has 25 states, 25 states have (on average 4.28) internal successors, (107), 25 states have internal predecessors, (107), 0 states have call successors, (0), 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:58:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:22,336 INFO L93 Difference]: Finished difference Result 248700 states and 742729 transitions. [2021-06-05 08:58:22,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-06-05 08:58:22,337 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 25 states have internal predecessors, (107), 0 states have call successors, (0), 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 71 [2021-06-05 08:58:22,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:22,841 INFO L225 Difference]: With dead ends: 248700 [2021-06-05 08:58:22,842 INFO L226 Difference]: Without dead ends: 248700 [2021-06-05 08:58:22,842 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1045.4ms TimeCoverageRelationStatistics Valid=338, Invalid=2112, Unknown=0, NotChecked=0, Total=2450 [2021-06-05 08:58:23,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248700 states. [2021-06-05 08:58:26,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248700 to 134205. [2021-06-05 08:58:26,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134205 states, 134202 states have (on average 3.017063829153068) internal successors, (404896), 134204 states have internal predecessors, (404896), 0 states have call successors, (0), 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:58:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134205 states to 134205 states and 404896 transitions. [2021-06-05 08:58:26,650 INFO L78 Accepts]: Start accepts. Automaton has 134205 states and 404896 transitions. Word has length 71 [2021-06-05 08:58:26,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:26,650 INFO L482 AbstractCegarLoop]: Abstraction has 134205 states and 404896 transitions. [2021-06-05 08:58:26,651 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 25 states have internal predecessors, (107), 0 states have call successors, (0), 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:58:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 134205 states and 404896 transitions. [2021-06-05 08:58:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:58:26,759 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:26,759 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, 1, 1, 1, 1] [2021-06-05 08:58:26,959 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable284,26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:58:26,960 INFO L430 AbstractCegarLoop]: === Iteration 45 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:26,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:26,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2115210903, now seen corresponding path program 26 times [2021-06-05 08:58:26,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:26,960 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770468829] [2021-06-05 08:58:26,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:27,761 WARN L205 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 4 [2021-06-05 08:58:27,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:27,763 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:27,763 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770468829] [2021-06-05 08:58:27,763 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770468829] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:27,763 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204330027] [2021-06-05 08:58:27,763 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 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:58:27,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:58:27,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:58:27,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 60 conjunts are in the unsatisfiable core [2021-06-05 08:58:27,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:58:27,932 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:58:27,932 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:27,936 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:27,936 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:27,936 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:58:27,979 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:58:27,979 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:58:27,980 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:27,984 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:27,985 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:27,985 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-06-05 08:58:28,027 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:58:28,027 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:28,034 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:28,035 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:28,035 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2021-06-05 08:58:28,073 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:58:28,074 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:28,082 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:28,083 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:58:28,083 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:20 [2021-06-05 08:58:28,162 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:58:28,162 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:58:28,163 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:28,180 INFO L354 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2021-06-05 08:58:28,181 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 43 treesize of output 25 [2021-06-05 08:58:28,181 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:28,203 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:28,205 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 08:58:28,205 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:53 [2021-06-05 08:58:28,425 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:58:28,425 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:58:28,426 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:28,431 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:28,433 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:58:28,433 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:22 [2021-06-05 08:58:28,537 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:58:28,538 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:28,542 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:58:28,542 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:58:28,544 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:28,548 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:28,549 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:58:28,549 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2021-06-05 08:58:28,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:28,571 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204330027] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:28,571 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:58:28,571 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2021-06-05 08:58:28,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97067695] [2021-06-05 08:58:28,571 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 08:58:28,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:28,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 08:58:28,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2021-06-05 08:58:28,572 INFO L87 Difference]: Start difference. First operand 134205 states and 404896 transitions. Second operand has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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:58:33,375 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 35 [2021-06-05 08:58:33,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:33,932 INFO L93 Difference]: Finished difference Result 173526 states and 519738 transitions. [2021-06-05 08:58:33,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-06-05 08:58:33,932 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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 71 [2021-06-05 08:58:33,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:34,229 INFO L225 Difference]: With dead ends: 173526 [2021-06-05 08:58:34,229 INFO L226 Difference]: Without dead ends: 173526 [2021-06-05 08:58:34,229 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2194 ImplicationChecksByTransitivity, 4021.6ms TimeCoverageRelationStatistics Valid=1102, Invalid=6380, Unknown=0, NotChecked=0, Total=7482 [2021-06-05 08:58:34,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173526 states. [2021-06-05 08:58:36,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173526 to 130488. [2021-06-05 08:58:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130488 states, 130485 states have (on average 3.0192742460819253) internal successors, (393970), 130487 states have internal predecessors, (393970), 0 states have call successors, (0), 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:58:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130488 states to 130488 states and 393970 transitions. [2021-06-05 08:58:37,074 INFO L78 Accepts]: Start accepts. Automaton has 130488 states and 393970 transitions. Word has length 71 [2021-06-05 08:58:37,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:37,075 INFO L482 AbstractCegarLoop]: Abstraction has 130488 states and 393970 transitions. [2021-06-05 08:58:37,075 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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:58:37,075 INFO L276 IsEmpty]: Start isEmpty. Operand 130488 states and 393970 transitions. [2021-06-05 08:58:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 08:58:37,183 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:37,183 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, 1, 1, 1, 1] [2021-06-05 08:58:37,384 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable287 [2021-06-05 08:58:37,384 INFO L430 AbstractCegarLoop]: === Iteration 46 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:37,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:37,385 INFO L82 PathProgramCache]: Analyzing trace with hash -874367023, now seen corresponding path program 27 times [2021-06-05 08:58:37,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:37,385 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187817623] [2021-06-05 08:58:37,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:37,732 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:37,732 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187817623] [2021-06-05 08:58:37,732 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187817623] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:37,732 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126261366] [2021-06-05 08:58:37,732 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 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:58:37,802 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:58:37,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:58:37,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 60 conjunts are in the unsatisfiable core [2021-06-05 08:58:37,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:58:37,817 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:58:37,817 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:37,821 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:37,821 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:37,821 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:58:37,834 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:58:37,834 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:58:37,836 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:37,839 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:37,839 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:37,839 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 08:58:37,915 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 13 treesize of output 9 [2021-06-05 08:58:37,915 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:37,923 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:37,924 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:58:37,924 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2021-06-05 08:58:38,008 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:58:38,008 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 24 [2021-06-05 08:58:38,009 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:38,043 INFO L354 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2021-06-05 08:58:38,044 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 2 case distinctions, treesize of input 45 treesize of output 27 [2021-06-05 08:58:38,045 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:38,067 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:38,400 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2021-06-05 08:58:38,409 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 08:58:38,409 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:61 [2021-06-05 08:58:38,596 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:58:38,597 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:38,603 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:38,604 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:58:38,604 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:31, output treesize:16 [2021-06-05 08:58:38,669 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-06-05 08:58:38,670 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 25 treesize of output 24 [2021-06-05 08:58:38,671 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:38,676 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:38,694 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:58:38,694 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:22 [2021-06-05 08:58:38,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:58:38,796 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:38,800 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:58:38,800 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:58:38,801 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:38,806 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:38,807 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:58:38,807 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2021-06-05 08:58:38,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-05 08:58:38,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126261366] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:38,828 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:58:38,828 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 29 [2021-06-05 08:58:38,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320434525] [2021-06-05 08:58:38,828 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 08:58:38,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:38,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 08:58:38,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2021-06-05 08:58:38,829 INFO L87 Difference]: Start difference. First operand 130488 states and 393970 transitions. Second operand has 29 states, 29 states have (on average 4.172413793103448) internal successors, (121), 29 states have internal predecessors, (121), 0 states have call successors, (0), 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:58:41,348 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2021-06-05 08:58:44,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:44,403 INFO L93 Difference]: Finished difference Result 182514 states and 545436 transitions. [2021-06-05 08:58:44,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-06-05 08:58:44,404 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.172413793103448) internal successors, (121), 29 states have internal predecessors, (121), 0 states have call successors, (0), 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 71 [2021-06-05 08:58:44,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:44,716 INFO L225 Difference]: With dead ends: 182514 [2021-06-05 08:58:44,717 INFO L226 Difference]: Without dead ends: 182514 [2021-06-05 08:58:44,717 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2976 ImplicationChecksByTransitivity, 3598.2ms TimeCoverageRelationStatistics Valid=1178, Invalid=7942, Unknown=0, NotChecked=0, Total=9120 [2021-06-05 08:58:45,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182514 states. [2021-06-05 08:58:47,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182514 to 132533. [2021-06-05 08:58:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132533 states, 132530 states have (on average 3.019542745038859) internal successors, (400180), 132532 states have internal predecessors, (400180), 0 states have call successors, (0), 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:58:47,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132533 states to 132533 states and 400180 transitions. [2021-06-05 08:58:47,631 INFO L78 Accepts]: Start accepts. Automaton has 132533 states and 400180 transitions. Word has length 71 [2021-06-05 08:58:47,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:47,631 INFO L482 AbstractCegarLoop]: Abstraction has 132533 states and 400180 transitions. [2021-06-05 08:58:47,631 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 4.172413793103448) internal successors, (121), 29 states have internal predecessors, (121), 0 states have call successors, (0), 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:58:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 132533 states and 400180 transitions. [2021-06-05 08:58:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-05 08:58:47,759 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:47,759 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:58:47,960 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable298 [2021-06-05 08:58:47,961 INFO L430 AbstractCegarLoop]: === Iteration 47 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:47,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:47,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1103335966, now seen corresponding path program 1 times [2021-06-05 08:58:47,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:47,961 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236779154] [2021-06-05 08:58:47,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:47,975 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:58:47,975 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:47,975 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236779154] [2021-06-05 08:58:47,975 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236779154] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:58:47,975 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:58:47,975 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 08:58:47,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584405789] [2021-06-05 08:58:47,976 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 08:58:47,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:47,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 08:58:47,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:58:47,976 INFO L87 Difference]: Start difference. First operand 132533 states and 400180 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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:58:48,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:48,401 INFO L93 Difference]: Finished difference Result 126341 states and 379141 transitions. [2021-06-05 08:58:48,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 08:58:48,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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:58:48,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:49,098 INFO L225 Difference]: With dead ends: 126341 [2021-06-05 08:58:49,098 INFO L226 Difference]: Without dead ends: 126111 [2021-06-05 08:58:49,098 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 08:58:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126111 states. [2021-06-05 08:58:50,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126111 to 119897. [2021-06-05 08:58:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119897 states, 119894 states have (on average 2.9972058651809097) internal successors, (359347), 119896 states have internal predecessors, (359347), 0 states have call successors, (0), 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:58:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119897 states to 119897 states and 359347 transitions. [2021-06-05 08:58:51,386 INFO L78 Accepts]: Start accepts. Automaton has 119897 states and 359347 transitions. Word has length 75 [2021-06-05 08:58:51,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:51,386 INFO L482 AbstractCegarLoop]: Abstraction has 119897 states and 359347 transitions. [2021-06-05 08:58:51,386 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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:58:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 119897 states and 359347 transitions. [2021-06-05 08:58:51,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-06-05 08:58:51,490 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:51,490 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 08:58:51,490 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable309 [2021-06-05 08:58:51,490 INFO L430 AbstractCegarLoop]: === Iteration 48 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:51,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:51,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1447468582, now seen corresponding path program 1 times [2021-06-05 08:58:51,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:51,491 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185383638] [2021-06-05 08:58:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:51,504 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:58:51,504 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:51,504 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185383638] [2021-06-05 08:58:51,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185383638] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 08:58:51,505 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 08:58:51,505 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-05 08:58:51,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766942249] [2021-06-05 08:58:51,505 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-05 08:58:51,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:51,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-05 08:58:51,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-05 08:58:51,505 INFO L87 Difference]: Start difference. First operand 119897 states and 359347 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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:58:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:52,274 INFO L93 Difference]: Finished difference Result 112253 states and 333963 transitions. [2021-06-05 08:58:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-05 08:58:52,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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:58:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:52,460 INFO L225 Difference]: With dead ends: 112253 [2021-06-05 08:58:52,461 INFO L226 Difference]: Without dead ends: 110063 [2021-06-05 08:58:52,461 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-05 08:58:52,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110063 states. [2021-06-05 08:58:54,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110063 to 104307. [2021-06-05 08:58:54,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104307 states, 104304 states have (on average 2.970701027764995) internal successors, (309856), 104306 states have internal predecessors, (309856), 0 states have call successors, (0), 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:58:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104307 states to 104307 states and 309856 transitions. [2021-06-05 08:58:54,614 INFO L78 Accepts]: Start accepts. Automaton has 104307 states and 309856 transitions. Word has length 75 [2021-06-05 08:58:54,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:58:54,614 INFO L482 AbstractCegarLoop]: Abstraction has 104307 states and 309856 transitions. [2021-06-05 08:58:54,614 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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:58:54,615 INFO L276 IsEmpty]: Start isEmpty. Operand 104307 states and 309856 transitions. [2021-06-05 08:58:54,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 08:58:54,700 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:58:54,700 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 08:58:54,700 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable310 [2021-06-05 08:58:54,700 INFO L430 AbstractCegarLoop]: === Iteration 49 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:58:54,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:58:54,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1339503831, now seen corresponding path program 9 times [2021-06-05 08:58:54,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:58:54,701 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106942381] [2021-06-05 08:58:54,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:58:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:58:55,341 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:58:55,342 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:58:55,342 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106942381] [2021-06-05 08:58:55,342 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106942381] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:55,342 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948120446] [2021-06-05 08:58:55,342 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 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:58:55,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:58:55,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:58:55,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 47 conjunts are in the unsatisfiable core [2021-06-05 08:58:55,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:58:55,595 INFO L354 Elim1Store]: treesize reduction 58, result has 31.8 percent of original size [2021-06-05 08:58:55,595 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 38 [2021-06-05 08:58:55,598 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:55,614 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 08:58:55,615 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 20 treesize of output 27 [2021-06-05 08:58:55,617 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:55,644 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:55,646 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:58:55,646 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:47 [2021-06-05 08:58:55,819 INFO L354 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2021-06-05 08:58:55,819 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 3 case distinctions, treesize of input 27 treesize of output 45 [2021-06-05 08:58:55,823 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:55,838 INFO L628 ElimStorePlain]: treesize reduction 17, result has 63.8 percent of original size [2021-06-05 08:58:55,840 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:58:55,840 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2021-06-05 08:58:55,886 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:55,887 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 23 treesize of output 19 [2021-06-05 08:58:55,887 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:58:55,891 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:58:55,892 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:58:55,892 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:4 [2021-06-05 08:58:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:58:55,895 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948120446] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:58:55,895 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:58:55,895 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 26 [2021-06-05 08:58:55,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136018006] [2021-06-05 08:58:55,895 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-05 08:58:55,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:58:55,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-05 08:58:55,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2021-06-05 08:58:55,896 INFO L87 Difference]: Start difference. First operand 104307 states and 309856 transitions. Second operand has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 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:58:57,936 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2021-06-05 08:58:58,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:58:58,476 INFO L93 Difference]: Finished difference Result 123821 states and 365708 transitions. [2021-06-05 08:58:58,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-06-05 08:58:58,477 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 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 77 [2021-06-05 08:58:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:58:58,688 INFO L225 Difference]: With dead ends: 123821 [2021-06-05 08:58:58,688 INFO L226 Difference]: Without dead ends: 123821 [2021-06-05 08:58:58,689 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1634.9ms TimeCoverageRelationStatistics Valid=498, Invalid=2258, Unknown=0, NotChecked=0, Total=2756 [2021-06-05 08:58:59,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123821 states. [2021-06-05 08:59:00,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123821 to 104885. [2021-06-05 08:59:00,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104885 states, 104882 states have (on average 2.9682404988463227) internal successors, (311315), 104884 states have internal predecessors, (311315), 0 states have call successors, (0), 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:59:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104885 states to 104885 states and 311315 transitions. [2021-06-05 08:59:00,743 INFO L78 Accepts]: Start accepts. Automaton has 104885 states and 311315 transitions. Word has length 77 [2021-06-05 08:59:00,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:59:00,743 INFO L482 AbstractCegarLoop]: Abstraction has 104885 states and 311315 transitions. [2021-06-05 08:59:00,743 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 26 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:59:00,744 INFO L276 IsEmpty]: Start isEmpty. Operand 104885 states and 311315 transitions. [2021-06-05 08:59:01,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 08:59:01,201 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:59:01,201 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 08:59:01,415 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable311 [2021-06-05 08:59:01,415 INFO L430 AbstractCegarLoop]: === Iteration 50 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:59:01,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:59:01,416 INFO L82 PathProgramCache]: Analyzing trace with hash 2093523355, now seen corresponding path program 10 times [2021-06-05 08:59:01,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:59:01,416 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568481628] [2021-06-05 08:59:01,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:59:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:59:01,640 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:59:01,640 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568481628] [2021-06-05 08:59:01,640 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568481628] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:01,640 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081281254] [2021-06-05 08:59:01,640 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 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:59:01,744 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 08:59:01,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:59:01,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 58 conjunts are in the unsatisfiable core [2021-06-05 08:59:01,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:59:01,763 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:59:01,764 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:01,767 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:01,768 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:01,768 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:59:01,816 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:59:01,816 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:59:01,821 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:01,826 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:01,826 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:01,827 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-06-05 08:59:01,868 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:59:01,868 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:01,875 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:01,876 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:01,876 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2021-06-05 08:59:01,905 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:59:01,906 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:01,914 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:01,915 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:59:01,915 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:20 [2021-06-05 08:59:01,989 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:59:01,989 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:59:01,990 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:01,998 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:02,001 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:02,001 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:28 [2021-06-05 08:59:02,113 INFO L446 ElimStorePlain]: Different costs {4=[v_prenex_61], 9=[v_prenex_64, |v_#memory_int_168|]} [2021-06-05 08:59:02,142 INFO L354 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2021-06-05 08:59:02,142 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 43 treesize of output 33 [2021-06-05 08:59:02,143 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:02,181 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:02,218 INFO L354 Elim1Store]: treesize reduction 81, result has 28.9 percent of original size [2021-06-05 08:59:02,219 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 4 case distinctions, treesize of input 50 treesize of output 46 [2021-06-05 08:59:02,220 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:02,257 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:02,281 INFO L354 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2021-06-05 08:59:02,282 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 3 case distinctions, treesize of input 26 treesize of output 40 [2021-06-05 08:59:02,283 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:02,294 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:59:02,295 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:59:02,296 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:02,336 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:02,358 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 08:59:02,358 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:163, output treesize:130 [2021-06-05 08:59:04,039 WARN L205 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2021-06-05 08:59:05,931 WARN L205 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 63 DAG size of output: 32 [2021-06-05 08:59:05,992 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_68], 1=[|#memory_int|]} [2021-06-05 08:59:05,994 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:59:05,995 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:06,000 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:06,004 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:59:06,004 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:59:06,005 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:06,009 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:06,010 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:59:06,010 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:7 [2021-06-05 08:59:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:59:06,029 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081281254] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:06,030 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:59:06,030 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 29 [2021-06-05 08:59:06,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708460763] [2021-06-05 08:59:06,030 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 08:59:06,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:59:06,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 08:59:06,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2021-06-05 08:59:06,030 INFO L87 Difference]: Start difference. First operand 104885 states and 311315 transitions. Second operand has 29 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 29 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:59:08,987 WARN L205 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2021-06-05 08:59:12,093 WARN L205 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2021-06-05 08:59:13,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:59:13,580 INFO L93 Difference]: Finished difference Result 163785 states and 483463 transitions. [2021-06-05 08:59:13,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 08:59:13,581 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 29 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 77 [2021-06-05 08:59:13,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:59:13,866 INFO L225 Difference]: With dead ends: 163785 [2021-06-05 08:59:13,866 INFO L226 Difference]: Without dead ends: 163785 [2021-06-05 08:59:13,866 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 9270.2ms TimeCoverageRelationStatistics Valid=251, Invalid=2005, Unknown=0, NotChecked=0, Total=2256 [2021-06-05 08:59:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163785 states. [2021-06-05 08:59:16,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163785 to 104085. [2021-06-05 08:59:16,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104085 states, 104082 states have (on average 2.968716973155781) internal successors, (308990), 104084 states have internal predecessors, (308990), 0 states have call successors, (0), 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:59:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104085 states to 104085 states and 308990 transitions. [2021-06-05 08:59:16,452 INFO L78 Accepts]: Start accepts. Automaton has 104085 states and 308990 transitions. Word has length 77 [2021-06-05 08:59:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:59:16,452 INFO L482 AbstractCegarLoop]: Abstraction has 104085 states and 308990 transitions. [2021-06-05 08:59:16,452 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 29 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:59:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 104085 states and 308990 transitions. [2021-06-05 08:59:16,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 08:59:16,536 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:59:16,536 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 08:59:16,737 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable320 [2021-06-05 08:59:16,737 INFO L430 AbstractCegarLoop]: === Iteration 51 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:59:16,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:59:16,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1899167571, now seen corresponding path program 11 times [2021-06-05 08:59:16,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:59:16,738 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209327655] [2021-06-05 08:59:16,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:59:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:16,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:59:16,987 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:59:16,987 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209327655] [2021-06-05 08:59:16,987 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209327655] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:16,988 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894380538] [2021-06-05 08:59:16,988 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 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:59:17,057 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 08:59:17,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:59:17,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 58 conjunts are in the unsatisfiable core [2021-06-05 08:59:17,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:59:17,090 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:59:17,091 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,094 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:17,095 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,095 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:59:17,150 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:59:17,151 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:59:17,152 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,156 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:17,157 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,157 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-06-05 08:59:17,199 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 13 treesize of output 9 [2021-06-05 08:59:17,200 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,207 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:17,207 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,208 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2021-06-05 08:59:17,239 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:59:17,240 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,249 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:17,250 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:59:17,250 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:22 [2021-06-05 08:59:17,340 INFO L354 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2021-06-05 08:59:17,340 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 45 treesize of output 27 [2021-06-05 08:59:17,341 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,363 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:59:17,363 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 24 [2021-06-05 08:59:17,365 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,385 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:17,386 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 08:59:17,386 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:85, output treesize:53 [2021-06-05 08:59:17,905 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:59:17,905 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:59:17,906 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:17,912 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:17,916 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:17,917 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:22 [2021-06-05 08:59:18,152 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:59:18,153 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:59:18,154 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:18,155 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:59:18,156 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:18,160 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:18,161 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:59:18,161 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2021-06-05 08:59:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:59:18,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894380538] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:18,183 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:59:18,183 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 32 [2021-06-05 08:59:18,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601042417] [2021-06-05 08:59:18,183 INFO L462 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-06-05 08:59:18,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:59:18,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-06-05 08:59:18,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2021-06-05 08:59:18,184 INFO L87 Difference]: Start difference. First operand 104085 states and 308990 transitions. Second operand has 32 states, 32 states have (on average 3.90625) internal successors, (125), 32 states have internal predecessors, (125), 0 states have call successors, (0), 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:59:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:59:23,143 INFO L93 Difference]: Finished difference Result 126683 states and 373539 transitions. [2021-06-05 08:59:23,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2021-06-05 08:59:23,144 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.90625) internal successors, (125), 32 states have internal predecessors, (125), 0 states have call successors, (0), 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 77 [2021-06-05 08:59:23,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:59:23,355 INFO L225 Difference]: With dead ends: 126683 [2021-06-05 08:59:23,355 INFO L226 Difference]: Without dead ends: 126683 [2021-06-05 08:59:23,355 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1744 ImplicationChecksByTransitivity, 3490.9ms TimeCoverageRelationStatistics Valid=866, Invalid=5140, Unknown=0, NotChecked=0, Total=6006 [2021-06-05 08:59:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126683 states. [2021-06-05 08:59:25,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126683 to 103431. [2021-06-05 08:59:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103431 states, 103428 states have (on average 2.9707139265962796) internal successors, (307255), 103430 states have internal predecessors, (307255), 0 states have call successors, (0), 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:59:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103431 states to 103431 states and 307255 transitions. [2021-06-05 08:59:25,430 INFO L78 Accepts]: Start accepts. Automaton has 103431 states and 307255 transitions. Word has length 77 [2021-06-05 08:59:25,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:59:25,430 INFO L482 AbstractCegarLoop]: Abstraction has 103431 states and 307255 transitions. [2021-06-05 08:59:25,430 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 3.90625) internal successors, (125), 32 states have internal predecessors, (125), 0 states have call successors, (0), 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:59:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 103431 states and 307255 transitions. [2021-06-05 08:59:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 08:59:25,511 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:59:25,511 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 08:59:25,712 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable355,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:59:25,712 INFO L430 AbstractCegarLoop]: === Iteration 52 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:59:25,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:59:25,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1862896287, now seen corresponding path program 12 times [2021-06-05 08:59:25,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:59:25,714 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758544502] [2021-06-05 08:59:25,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:59:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:59:25,983 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:59:25,983 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758544502] [2021-06-05 08:59:25,983 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758544502] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:25,983 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633703300] [2021-06-05 08:59:25,983 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 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:59:26,389 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 08:59:26,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:59:26,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 63 conjunts are in the unsatisfiable core [2021-06-05 08:59:26,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:59:26,418 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:59:26,418 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:26,422 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:26,422 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:26,422 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:59:26,450 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:59:26,450 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:59:26,451 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:26,454 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:26,454 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:26,455 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 08:59:26,546 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 13 treesize of output 9 [2021-06-05 08:59:26,547 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:26,554 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:26,555 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:26,555 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2021-06-05 08:59:26,696 INFO L354 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2021-06-05 08:59:26,696 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 2 case distinctions, treesize of input 45 treesize of output 27 [2021-06-05 08:59:26,697 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:26,704 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:26,706 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:26,706 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:38 [2021-06-05 08:59:26,784 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-06-05 08:59:26,784 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 1 case distinctions, treesize of input 25 treesize of output 24 [2021-06-05 08:59:26,785 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:26,791 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:26,793 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:26,793 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:26 [2021-06-05 08:59:26,862 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 08:59:26,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 08:59:26,864 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:26,867 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:59:26,868 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:26,884 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:26,887 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:59:26,887 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:23 [2021-06-05 08:59:26,923 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:59:26,924 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:26,928 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:26,929 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:59:26,930 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:26,932 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:26,933 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:59:26,933 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2021-06-05 08:59:26,954 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:59:26,954 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633703300] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:26,954 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:59:26,954 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2021-06-05 08:59:26,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518657146] [2021-06-05 08:59:26,954 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 08:59:26,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:59:26,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 08:59:26,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2021-06-05 08:59:26,955 INFO L87 Difference]: Start difference. First operand 103431 states and 307255 transitions. Second operand has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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:59:30,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:59:30,402 INFO L93 Difference]: Finished difference Result 125643 states and 370415 transitions. [2021-06-05 08:59:30,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 08:59:30,403 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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 77 [2021-06-05 08:59:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:59:30,621 INFO L225 Difference]: With dead ends: 125643 [2021-06-05 08:59:30,621 INFO L226 Difference]: Without dead ends: 125643 [2021-06-05 08:59:30,622 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 1972.3ms TimeCoverageRelationStatistics Valid=506, Invalid=3154, Unknown=0, NotChecked=0, Total=3660 [2021-06-05 08:59:31,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125643 states. [2021-06-05 08:59:32,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125643 to 105267. [2021-06-05 08:59:32,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105267 states, 105264 states have (on average 2.9739892080863353) internal successors, (313054), 105266 states have internal predecessors, (313054), 0 states have call successors, (0), 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:59:32,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105267 states to 105267 states and 313054 transitions. [2021-06-05 08:59:32,823 INFO L78 Accepts]: Start accepts. Automaton has 105267 states and 313054 transitions. Word has length 77 [2021-06-05 08:59:32,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:59:32,823 INFO L482 AbstractCegarLoop]: Abstraction has 105267 states and 313054 transitions. [2021-06-05 08:59:32,823 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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:59:32,823 INFO L276 IsEmpty]: Start isEmpty. Operand 105267 states and 313054 transitions. [2021-06-05 08:59:32,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 08:59:32,905 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:59:32,905 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 08:59:33,106 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable369 [2021-06-05 08:59:33,106 INFO L430 AbstractCegarLoop]: === Iteration 53 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:59:33,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:59:33,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1792093871, now seen corresponding path program 13 times [2021-06-05 08:59:33,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:59:33,106 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380447983] [2021-06-05 08:59:33,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:59:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:59:33,468 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:59:33,468 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380447983] [2021-06-05 08:59:33,468 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380447983] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:33,468 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711544406] [2021-06-05 08:59:33,468 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 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:59:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:33,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 60 conjunts are in the unsatisfiable core [2021-06-05 08:59:33,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:59:33,561 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:59:33,561 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:33,565 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:33,566 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:33,566 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:59:33,585 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:59:33,585 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:59:33,586 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:33,591 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:33,592 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:33,592 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2021-06-05 08:59:33,671 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:59:33,671 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:59:33,672 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:33,682 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:33,683 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:33,683 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:37 [2021-06-05 08:59:33,727 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:59:33,727 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:59:33,729 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:33,740 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:33,741 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:33,741 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:37 [2021-06-05 08:59:33,775 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 11 treesize of output 7 [2021-06-05 08:59:33,776 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:33,787 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:33,788 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:33,788 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2021-06-05 08:59:33,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, 3 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:59:33,876 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:33,885 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:33,886 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:59:33,887 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:22 [2021-06-05 08:59:33,924 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:59:33,924 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:33,944 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:33,947 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:59:33,948 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:33,966 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:33,967 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:59:33,967 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:60 [2021-06-05 08:59:34,023 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:59:34,024 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:34,028 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:59:34,029 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:34,051 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:34,052 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:59:34,052 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:44 [2021-06-05 08:59:34,197 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:59:34,198 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:34,201 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:34,201 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:59:34,202 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2021-06-05 08:59:34,223 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:59:34,223 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711544406] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:34,224 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:59:34,224 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 31 [2021-06-05 08:59:34,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116113174] [2021-06-05 08:59:34,224 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 08:59:34,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:59:34,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 08:59:34,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2021-06-05 08:59:34,224 INFO L87 Difference]: Start difference. First operand 105267 states and 313054 transitions. Second operand has 31 states, 31 states have (on average 3.903225806451613) internal successors, (121), 31 states have internal predecessors, (121), 0 states have call successors, (0), 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:59:35,947 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2021-06-05 08:59:36,311 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 51 [2021-06-05 08:59:37,429 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 53 [2021-06-05 08:59:37,988 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 67 [2021-06-05 08:59:38,374 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 57 [2021-06-05 08:59:39,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:59:39,410 INFO L93 Difference]: Finished difference Result 147169 states and 435255 transitions. [2021-06-05 08:59:39,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 08:59:39,411 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.903225806451613) internal successors, (121), 31 states have internal predecessors, (121), 0 states have call successors, (0), 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 77 [2021-06-05 08:59:39,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:59:39,675 INFO L225 Difference]: With dead ends: 147169 [2021-06-05 08:59:39,676 INFO L226 Difference]: Without dead ends: 147169 [2021-06-05 08:59:39,676 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 3218.0ms TimeCoverageRelationStatistics Valid=529, Invalid=3377, Unknown=0, NotChecked=0, Total=3906 [2021-06-05 08:59:40,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147169 states. [2021-06-05 08:59:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147169 to 108763. [2021-06-05 08:59:41,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108763 states, 108760 states have (on average 2.9813718278778962) internal successors, (324254), 108762 states have internal predecessors, (324254), 0 states have call successors, (0), 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:59:42,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108763 states to 108763 states and 324254 transitions. [2021-06-05 08:59:42,147 INFO L78 Accepts]: Start accepts. Automaton has 108763 states and 324254 transitions. Word has length 77 [2021-06-05 08:59:42,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:59:42,147 INFO L482 AbstractCegarLoop]: Abstraction has 108763 states and 324254 transitions. [2021-06-05 08:59:42,147 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 3.903225806451613) internal successors, (121), 31 states have internal predecessors, (121), 0 states have call successors, (0), 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:59:42,147 INFO L276 IsEmpty]: Start isEmpty. Operand 108763 states and 324254 transitions. [2021-06-05 08:59:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 08:59:42,234 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:59:42,234 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 08:59:42,441 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable377 [2021-06-05 08:59:42,442 INFO L430 AbstractCegarLoop]: === Iteration 54 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:59:42,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:59:42,442 INFO L82 PathProgramCache]: Analyzing trace with hash -52530253, now seen corresponding path program 14 times [2021-06-05 08:59:42,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:59:42,442 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641898198] [2021-06-05 08:59:42,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:59:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:42,690 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:59:42,690 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:59:42,691 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641898198] [2021-06-05 08:59:42,691 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641898198] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:42,691 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694361511] [2021-06-05 08:59:42,691 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 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:59:42,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 08:59:42,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:59:42,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 58 conjunts are in the unsatisfiable core [2021-06-05 08:59:42,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:59:42,777 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:59:42,778 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:42,781 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:42,782 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:42,782 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:59:42,826 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:59:42,826 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:59:42,827 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:42,831 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:42,832 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:42,832 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-06-05 08:59:42,875 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:59:42,875 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:42,882 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:42,883 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:42,883 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2021-06-05 08:59:42,965 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:59:42,965 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 1 case distinctions, treesize of input 19 treesize of output 22 [2021-06-05 08:59:42,966 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:42,974 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:42,976 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:42,977 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:32 [2021-06-05 08:59:43,033 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:59:43,034 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:43,056 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 08:59:43,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 08:59:43,058 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:43,080 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:43,083 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:59:43,083 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:72, output treesize:35 [2021-06-05 08:59:43,487 INFO L446 ElimStorePlain]: Different costs {4=[v_prenex_79, |v_#memory_int_183|], 5=[v_prenex_77]} [2021-06-05 08:59:43,519 INFO L354 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2021-06-05 08:59:43,519 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 43 treesize of output 33 [2021-06-05 08:59:43,520 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:43,567 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:43,601 INFO L354 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2021-06-05 08:59:43,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 43 treesize of output 25 [2021-06-05 08:59:43,603 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:43,640 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:43,652 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:59:43,652 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:59:43,653 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:43,663 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:59:43,663 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:59:43,664 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:43,695 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:43,700 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2021-06-05 08:59:43,700 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:149, output treesize:68 [2021-06-05 08:59:43,909 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_82], 1=[|#memory_int|]} [2021-06-05 08:59:43,911 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:59:43,912 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:43,917 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:43,922 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 08:59:43,923 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:59:43,924 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:43,928 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:43,929 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 08:59:43,929 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:7 [2021-06-05 08:59:43,950 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:59:43,950 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694361511] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:43,950 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:59:43,950 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 29 [2021-06-05 08:59:43,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872521530] [2021-06-05 08:59:43,951 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 08:59:43,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:59:43,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 08:59:43,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2021-06-05 08:59:43,951 INFO L87 Difference]: Start difference. First operand 108763 states and 324254 transitions. Second operand has 29 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 29 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:59:47,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 08:59:47,227 INFO L93 Difference]: Finished difference Result 168115 states and 498354 transitions. [2021-06-05 08:59:47,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 08:59:47,228 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 29 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 77 [2021-06-05 08:59:47,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 08:59:47,519 INFO L225 Difference]: With dead ends: 168115 [2021-06-05 08:59:47,519 INFO L226 Difference]: Without dead ends: 168115 [2021-06-05 08:59:47,520 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 1437.4ms TimeCoverageRelationStatistics Valid=322, Invalid=2330, Unknown=0, NotChecked=0, Total=2652 [2021-06-05 08:59:48,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168115 states. [2021-06-05 08:59:49,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168115 to 107125. [2021-06-05 08:59:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107125 states, 107122 states have (on average 2.980246821381229) internal successors, (319250), 107124 states have internal predecessors, (319250), 0 states have call successors, (0), 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:59:50,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107125 states to 107125 states and 319250 transitions. [2021-06-05 08:59:50,218 INFO L78 Accepts]: Start accepts. Automaton has 107125 states and 319250 transitions. Word has length 77 [2021-06-05 08:59:50,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 08:59:50,218 INFO L482 AbstractCegarLoop]: Abstraction has 107125 states and 319250 transitions. [2021-06-05 08:59:50,218 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 29 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:59:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 107125 states and 319250 transitions. [2021-06-05 08:59:50,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 08:59:50,303 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 08:59:50,303 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 08:59:50,504 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable381,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 08:59:50,504 INFO L430 AbstractCegarLoop]: === Iteration 55 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 08:59:50,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 08:59:50,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1506894989, now seen corresponding path program 15 times [2021-06-05 08:59:50,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 08:59:50,504 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307493415] [2021-06-05 08:59:50,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 08:59:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 08:59:50,855 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:59:50,856 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 08:59:50,856 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307493415] [2021-06-05 08:59:50,856 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307493415] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:50,856 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130848600] [2021-06-05 08:59:50,856 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 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:59:50,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 08:59:50,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 08:59:50,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 67 conjunts are in the unsatisfiable core [2021-06-05 08:59:50,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 08:59:50,942 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:59:50,943 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:50,946 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:50,947 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:50,947 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 08:59:50,968 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 08:59:50,968 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:59:50,969 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:50,975 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:50,975 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:50,976 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2021-06-05 08:59:51,054 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 08:59:51,055 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:59:51,056 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:51,066 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:51,067 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:51,067 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:37 [2021-06-05 08:59:51,116 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 08:59:51,117 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:59:51,119 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:51,130 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:51,131 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:51,131 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:37 [2021-06-05 08:59:51,166 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 11 treesize of output 7 [2021-06-05 08:59:51,166 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:51,179 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:51,180 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 08:59:51,180 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2021-06-05 08:59:51,320 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 08:59:51,321 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 1 case distinctions, treesize of input 19 treesize of output 22 [2021-06-05 08:59:51,322 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:51,337 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:51,339 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 08:59:51,339 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:52 [2021-06-05 08:59:51,509 INFO L446 ElimStorePlain]: Different costs {4=[|v_#memory_int_186|], 9=[v_prenex_89, v_prenex_86]} [2021-06-05 08:59:51,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2021-06-05 08:59:51,518 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:51,655 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2021-06-05 08:59:51,655 INFO L628 ElimStorePlain]: treesize reduction 8, result has 96.7 percent of original size [2021-06-05 08:59:51,675 INFO L354 Elim1Store]: treesize reduction 36, result has 28.0 percent of original size [2021-06-05 08:59:51,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 42 [2021-06-05 08:59:51,677 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:51,742 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:51,757 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-06-05 08:59:51,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2021-06-05 08:59:52,005 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:52,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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:59:52,012 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:52,143 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2021-06-05 08:59:52,144 INFO L628 ElimStorePlain]: treesize reduction 8, result has 96.4 percent of original size [2021-06-05 08:59:52,149 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 08:59:52,149 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:259, output treesize:187 [2021-06-05 08:59:52,302 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 08:59:52,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-06-05 08:59:52,304 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:52,314 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 08:59:52,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-06-05 08:59:52,316 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:52,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2021-06-05 08:59:52,327 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:52,336 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-06-05 08:59:52,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 38 [2021-06-05 08:59:52,338 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:52,398 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:52,402 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 08:59:52,402 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:231, output treesize:135 [2021-06-05 08:59:52,752 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 08:59:52,752 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 21 [2021-06-05 08:59:52,754 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:52,767 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:52,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2021-06-05 08:59:52,770 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 08:59:52,780 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 08:59:52,782 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:59:52,782 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:79, output treesize:7 [2021-06-05 08:59:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 08:59:52,804 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130848600] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 08:59:52,804 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 08:59:52,804 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2021-06-05 08:59:52,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056130917] [2021-06-05 08:59:52,805 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 08:59:52,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 08:59:52,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 08:59:52,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2021-06-05 08:59:52,805 INFO L87 Difference]: Start difference. First operand 107125 states and 319250 transitions. Second operand has 31 states, 31 states have (on average 3.903225806451613) internal successors, (121), 31 states have internal predecessors, (121), 0 states have call successors, (0), 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:59:54,648 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2021-06-05 08:59:54,813 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2021-06-05 08:59:55,118 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2021-06-05 08:59:55,456 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2021-06-05 08:59:55,887 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 90 [2021-06-05 08:59:56,169 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2021-06-05 08:59:56,424 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2021-06-05 08:59:56,616 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2021-06-05 08:59:56,949 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 104 [2021-06-05 08:59:57,335 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 84 [2021-06-05 08:59:57,476 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 75 [2021-06-05 09:00:05,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:00:05,398 INFO L93 Difference]: Finished difference Result 206093 states and 612009 transitions. [2021-06-05 09:00:05,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-06-05 09:00:05,404 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.903225806451613) internal successors, (121), 31 states have internal predecessors, (121), 0 states have call successors, (0), 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 77 [2021-06-05 09:00:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:00:05,861 INFO L225 Difference]: With dead ends: 206093 [2021-06-05 09:00:05,861 INFO L226 Difference]: Without dead ends: 206093 [2021-06-05 09:00:05,861 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1816 ImplicationChecksByTransitivity, 3803.1ms TimeCoverageRelationStatistics Valid=650, Invalid=5050, Unknown=0, NotChecked=0, Total=5700 [2021-06-05 09:00:06,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206093 states. [2021-06-05 09:00:08,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206093 to 119843. [2021-06-05 09:00:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119843 states, 119840 states have (on average 2.9846211615487315) internal successors, (357677), 119842 states have internal predecessors, (357677), 0 states have call successors, (0), 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 09:00:09,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119843 states to 119843 states and 357677 transitions. [2021-06-05 09:00:09,236 INFO L78 Accepts]: Start accepts. Automaton has 119843 states and 357677 transitions. Word has length 77 [2021-06-05 09:00:09,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:00:09,236 INFO L482 AbstractCegarLoop]: Abstraction has 119843 states and 357677 transitions. [2021-06-05 09:00:09,236 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 3.903225806451613) internal successors, (121), 31 states have internal predecessors, (121), 0 states have call successors, (0), 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 09:00:09,237 INFO L276 IsEmpty]: Start isEmpty. Operand 119843 states and 357677 transitions. [2021-06-05 09:00:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 09:00:09,330 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:00:09,330 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 09:00:09,530 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable396 [2021-06-05 09:00:09,531 INFO L430 AbstractCegarLoop]: === Iteration 56 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:00:09,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:00:09,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1697313571, now seen corresponding path program 16 times [2021-06-05 09:00:09,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:00:09,531 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766762858] [2021-06-05 09:00:09,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:00:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:00:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:00:09,806 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:00:09,806 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766762858] [2021-06-05 09:00:09,806 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766762858] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:00:09,806 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282591808] [2021-06-05 09:00:09,806 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 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 09:00:09,881 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:00:09,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:00:09,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 60 conjunts are in the unsatisfiable core [2021-06-05 09:00:09,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:00:09,901 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 09:00:09,901 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:09,905 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:09,905 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:09,905 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:00:09,931 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:00:09,932 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 09:00:09,933 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:09,936 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:09,937 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:09,937 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 09:00:10,340 WARN L205 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2021-06-05 09:00:10,362 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 09:00:10,363 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,369 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:10,370 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,370 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2021-06-05 09:00:10,402 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-06-05 09:00:10,402 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 09:00:10,403 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,447 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:10,448 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,448 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2021-06-05 09:00:10,475 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 13 treesize of output 9 [2021-06-05 09:00:10,476 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,487 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:10,488 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,488 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2021-06-05 09:00:10,565 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 09:00:10,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2021-06-05 09:00:10,567 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,577 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:10,578 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,578 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:34 [2021-06-05 09:00:10,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2021-06-05 09:00:10,616 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,626 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:10,628 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:00:10,628 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:42 [2021-06-05 09:00:10,765 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 09:00:10,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2021-06-05 09:00:10,767 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,801 INFO L354 Elim1Store]: treesize reduction 66, result has 31.3 percent of original size [2021-06-05 09:00:10,802 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 3 case distinctions, treesize of input 56 treesize of output 45 [2021-06-05 09:00:10,803 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:10,835 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:10,860 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2021-06-05 09:00:10,861 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:125, output treesize:96 [2021-06-05 09:00:12,944 WARN L205 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 58 [2021-06-05 09:00:17,539 WARN L205 SmtUtils]: Spent 4.42 s on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2021-06-05 09:00:21,624 WARN L205 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 43 [2021-06-05 09:00:21,774 INFO L354 Elim1Store]: treesize reduction 84, result has 35.4 percent of original size [2021-06-05 09:00:21,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 40 treesize of output 72 [2021-06-05 09:00:21,776 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:21,796 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 09:00:21,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 09:00:21,797 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:21,846 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:21,915 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2021-06-05 09:00:21,915 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:93, output treesize:96 [2021-06-05 09:00:28,069 WARN L205 SmtUtils]: Spent 6.01 s on a formula simplification. DAG size of input: 56 DAG size of output: 10 [2021-06-05 09:00:28,073 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 09:00:28,074 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:28,075 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:28,075 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 09:00:28,075 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 09:00:28,096 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:00:28,097 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282591808] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:00:28,097 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:00:28,097 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2021-06-05 09:00:28,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408039434] [2021-06-05 09:00:28,097 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 09:00:28,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:00:28,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 09:00:28,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=840, Unknown=0, NotChecked=0, Total=930 [2021-06-05 09:00:28,098 INFO L87 Difference]: Start difference. First operand 119843 states and 357677 transitions. Second operand has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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 09:00:33,728 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 80 [2021-06-05 09:00:34,061 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 91 [2021-06-05 09:00:39,909 WARN L205 SmtUtils]: Spent 5.73 s on a formula simplification. DAG size of input: 78 DAG size of output: 78 [2021-06-05 09:00:49,155 WARN L205 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 46 [2021-06-05 09:00:53,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:00:53,145 INFO L93 Difference]: Finished difference Result 182745 states and 540282 transitions. [2021-06-05 09:00:53,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-06-05 09:00:53,145 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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 77 [2021-06-05 09:00:53,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:00:53,490 INFO L225 Difference]: With dead ends: 182745 [2021-06-05 09:00:53,490 INFO L226 Difference]: Without dead ends: 182745 [2021-06-05 09:00:53,491 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 28284.6ms TimeCoverageRelationStatistics Valid=406, Invalid=4016, Unknown=0, NotChecked=0, Total=4422 [2021-06-05 09:00:54,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182745 states. [2021-06-05 09:00:56,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182745 to 121721. [2021-06-05 09:00:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121721 states, 121718 states have (on average 2.9864851542089093) internal successors, (363509), 121720 states have internal predecessors, (363509), 0 states have call successors, (0), 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 09:00:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121721 states to 121721 states and 363509 transitions. [2021-06-05 09:00:56,455 INFO L78 Accepts]: Start accepts. Automaton has 121721 states and 363509 transitions. Word has length 77 [2021-06-05 09:00:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:00:56,455 INFO L482 AbstractCegarLoop]: Abstraction has 121721 states and 363509 transitions. [2021-06-05 09:00:56,455 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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 09:00:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 121721 states and 363509 transitions. [2021-06-05 09:00:56,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 09:00:56,543 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:00:56,544 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 09:00:56,744 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable410 [2021-06-05 09:00:56,744 INFO L430 AbstractCegarLoop]: === Iteration 57 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:00:56,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:00:56,744 INFO L82 PathProgramCache]: Analyzing trace with hash 546235227, now seen corresponding path program 28 times [2021-06-05 09:00:56,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:00:56,745 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822766621] [2021-06-05 09:00:56,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:00:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:00:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:00:56,902 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:00:56,902 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822766621] [2021-06-05 09:00:56,903 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822766621] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:00:56,903 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178279207] [2021-06-05 09:00:56,903 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 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 09:00:56,974 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:00:56,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:00:56,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 47 conjunts are in the unsatisfiable core [2021-06-05 09:00:56,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:00:56,995 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 09:00:56,996 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:56,998 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:56,999 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:00:56,999 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 09:00:57,045 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:00:57,045 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 09:00:57,046 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:57,051 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:57,051 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 09:00:57,052 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2021-06-05 09:00:57,096 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 09:00:57,096 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 09:00:57,097 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:57,105 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:57,108 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 09:00:57,108 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:31 [2021-06-05 09:00:57,167 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 09:00:57,167 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 09:00:57,169 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:57,177 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:57,178 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 09:00:57,178 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:8 [2021-06-05 09:00:57,221 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 09:00:57,222 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:57,228 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:57,229 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 09:00:57,229 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2021-06-05 09:00:57,330 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 09:00:57,331 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 20 treesize of output 27 [2021-06-05 09:00:57,333 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:57,361 INFO L354 Elim1Store]: treesize reduction 58, result has 31.8 percent of original size [2021-06-05 09:00:57,362 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 38 [2021-06-05 09:00:57,365 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:57,389 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:57,391 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 09:00:57,391 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:41 [2021-06-05 09:00:57,525 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:57,525 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 23 treesize of output 19 [2021-06-05 09:00:57,526 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:00:57,530 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:00:57,531 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 09:00:57,531 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:4 [2021-06-05 09:00:57,533 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:00:57,533 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178279207] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:00:57,533 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:00:57,533 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 27 [2021-06-05 09:00:57,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417106024] [2021-06-05 09:00:57,534 INFO L462 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-06-05 09:00:57,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:00:57,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-06-05 09:00:57,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2021-06-05 09:00:57,534 INFO L87 Difference]: Start difference. First operand 121721 states and 363509 transitions. Second operand has 27 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 27 states have internal predecessors, (100), 0 states have call successors, (0), 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 09:00:58,242 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2021-06-05 09:01:03,448 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2021-06-05 09:01:09,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:01:09,774 INFO L93 Difference]: Finished difference Result 232625 states and 684128 transitions. [2021-06-05 09:01:09,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2021-06-05 09:01:09,775 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 27 states have internal predecessors, (100), 0 states have call successors, (0), 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 77 [2021-06-05 09:01:09,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:01:10,231 INFO L225 Difference]: With dead ends: 232625 [2021-06-05 09:01:10,231 INFO L226 Difference]: Without dead ends: 231281 [2021-06-05 09:01:10,232 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9664 ImplicationChecksByTransitivity, 8353.3ms TimeCoverageRelationStatistics Valid=4092, Invalid=20714, Unknown=0, NotChecked=0, Total=24806 [2021-06-05 09:01:10,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231281 states. [2021-06-05 09:01:13,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231281 to 136015. [2021-06-05 09:01:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136015 states, 136012 states have (on average 2.996831161956298) internal successors, (407605), 136014 states have internal predecessors, (407605), 0 states have call successors, (0), 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 09:01:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136015 states to 136015 states and 407605 transitions. [2021-06-05 09:01:13,738 INFO L78 Accepts]: Start accepts. Automaton has 136015 states and 407605 transitions. Word has length 77 [2021-06-05 09:01:13,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:01:13,738 INFO L482 AbstractCegarLoop]: Abstraction has 136015 states and 407605 transitions. [2021-06-05 09:01:13,738 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 27 states, 27 states have (on average 3.7037037037037037) internal successors, (100), 27 states have internal predecessors, (100), 0 states have call successors, (0), 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 09:01:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 136015 states and 407605 transitions. [2021-06-05 09:01:13,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 09:01:13,837 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:01:13,837 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 09:01:14,038 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable486 [2021-06-05 09:01:14,038 INFO L430 AbstractCegarLoop]: === Iteration 58 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:01:14,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:01:14,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1849929877, now seen corresponding path program 29 times [2021-06-05 09:01:14,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:01:14,038 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177481957] [2021-06-05 09:01:14,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:01:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:01:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:01:14,205 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:01:14,205 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177481957] [2021-06-05 09:01:14,205 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177481957] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:01:14,205 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483041764] [2021-06-05 09:01:14,205 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 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 09:01:14,299 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 09:01:14,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:01:14,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 55 conjunts are in the unsatisfiable core [2021-06-05 09:01:14,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:01:14,334 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 09:01:14,335 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:14,338 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:14,339 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:01:14,339 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:01:14,739 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:01:14,740 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 09:01:14,741 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:14,744 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:14,745 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:01:14,745 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 09:01:14,852 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 09:01:14,877 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:14,882 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:14,884 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:01:14,884 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:18 [2021-06-05 09:01:14,981 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 09:01:14,982 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 26 [2021-06-05 09:01:14,983 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:14,993 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:14,995 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 09:01:14,995 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2021-06-05 09:01:15,148 INFO L354 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2021-06-05 09:01:15,148 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 2 case distinctions, treesize of input 43 treesize of output 33 [2021-06-05 09:01:15,150 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:15,159 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:15,163 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 09:01:15,163 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:26 [2021-06-05 09:01:15,233 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 09:01:15,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 09:01:15,234 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:15,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, 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 09:01:15,239 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:15,256 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:15,259 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:01:15,259 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:23 [2021-06-05 09:01:15,298 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 09:01:15,299 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:15,304 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:15,305 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 09:01:15,306 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:15,308 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:15,308 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 09:01:15,309 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2021-06-05 09:01:15,328 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:01:15,328 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483041764] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:01:15,328 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:01:15,328 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2021-06-05 09:01:15,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083343278] [2021-06-05 09:01:15,328 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 09:01:15,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:01:15,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 09:01:15,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2021-06-05 09:01:15,329 INFO L87 Difference]: Start difference. First operand 136015 states and 407605 transitions. Second operand has 28 states, 28 states have (on average 4.5) internal successors, (126), 28 states have internal predecessors, (126), 0 states have call successors, (0), 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 09:01:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:01:21,580 INFO L93 Difference]: Finished difference Result 229301 states and 675062 transitions. [2021-06-05 09:01:21,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2021-06-05 09:01:21,593 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.5) internal successors, (126), 28 states have internal predecessors, (126), 0 states have call successors, (0), 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 77 [2021-06-05 09:01:21,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:01:22,008 INFO L225 Difference]: With dead ends: 229301 [2021-06-05 09:01:22,008 INFO L226 Difference]: Without dead ends: 228593 [2021-06-05 09:01:22,009 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5139 ImplicationChecksByTransitivity, 2965.9ms TimeCoverageRelationStatistics Valid=1764, Invalid=12516, Unknown=0, NotChecked=0, Total=14280 [2021-06-05 09:01:22,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228593 states. [2021-06-05 09:01:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228593 to 137453. [2021-06-05 09:01:25,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137453 states, 137450 states have (on average 2.9959330665696617) internal successors, (411791), 137452 states have internal predecessors, (411791), 0 states have call successors, (0), 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 09:01:25,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137453 states to 137453 states and 411791 transitions. [2021-06-05 09:01:25,505 INFO L78 Accepts]: Start accepts. Automaton has 137453 states and 411791 transitions. Word has length 77 [2021-06-05 09:01:25,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:01:25,505 INFO L482 AbstractCegarLoop]: Abstraction has 137453 states and 411791 transitions. [2021-06-05 09:01:25,506 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 4.5) internal successors, (126), 28 states have internal predecessors, (126), 0 states have call successors, (0), 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 09:01:25,506 INFO L276 IsEmpty]: Start isEmpty. Operand 137453 states and 411791 transitions. [2021-06-05 09:01:26,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 09:01:26,012 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:01:26,012 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 09:01:26,233 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable493,38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:01:26,234 INFO L430 AbstractCegarLoop]: === Iteration 59 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:01:26,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:01:26,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1445343439, now seen corresponding path program 30 times [2021-06-05 09:01:26,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:01:26,234 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284669961] [2021-06-05 09:01:26,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:01:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:01:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:01:26,430 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:01:26,430 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284669961] [2021-06-05 09:01:26,430 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284669961] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:01:26,430 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716292241] [2021-06-05 09:01:26,430 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 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 09:01:26,498 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 09:01:26,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:01:26,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 60 conjunts are in the unsatisfiable core [2021-06-05 09:01:26,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:01:26,530 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 09:01:26,531 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:26,534 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:26,535 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:01:26,535 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:01:26,582 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-06-05 09:01:26,582 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 09:01:26,583 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:26,587 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:26,588 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:01:26,588 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2021-06-05 09:01:26,628 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:01:26,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:01:26,630 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:26,638 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:26,639 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 09:01:26,639 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:30 [2021-06-05 09:01:26,688 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-06-05 09:01:26,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 09:01:26,690 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:26,699 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:26,700 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 09:01:26,700 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:18 [2021-06-05 09:01:26,747 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 09:01:26,748 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:26,756 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:26,756 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:01:26,757 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2021-06-05 09:01:26,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 09:01:26,789 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:26,798 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:26,799 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 09:01:26,799 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:24 [2021-06-05 09:01:26,831 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 09:01:26,831 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:26,838 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:26,840 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:01:26,840 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2021-06-05 09:01:27,044 INFO L354 Elim1Store]: treesize reduction 89, result has 29.4 percent of original size [2021-06-05 09:01:27,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 50 [2021-06-05 09:01:27,045 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:27,071 INFO L354 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2021-06-05 09:01:27,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 40 [2021-06-05 09:01:27,072 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:27,102 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:27,155 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2021-06-05 09:01:27,155 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:97, output treesize:91 [2021-06-05 09:01:34,815 WARN L205 SmtUtils]: Spent 7.35 s on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2021-06-05 09:01:37,663 WARN L205 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2021-06-05 09:01:37,767 INFO L446 ElimStorePlain]: Different costs {3=[|#memory_int|], 5=[v_prenex_111]} [2021-06-05 09:01:37,771 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-06-05 09:01:37,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 33 treesize of output 13 [2021-06-05 09:01:37,773 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:37,784 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:37,794 INFO L354 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2021-06-05 09:01:37,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 33 treesize of output 22 [2021-06-05 09:01:37,795 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:37,805 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:37,806 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:01:37,806 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:75, output treesize:3 [2021-06-05 09:01:37,828 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:01:37,828 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716292241] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:01:37,828 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:01:37,828 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 30 [2021-06-05 09:01:37,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314234683] [2021-06-05 09:01:37,828 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 09:01:37,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:01:37,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 09:01:37,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2021-06-05 09:01:37,829 INFO L87 Difference]: Start difference. First operand 137453 states and 411791 transitions. Second operand has 30 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 30 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 09:01:42,608 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2021-06-05 09:01:42,749 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2021-06-05 09:01:47,306 WARN L205 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 42 [2021-06-05 09:01:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:01:51,001 INFO L93 Difference]: Finished difference Result 178283 states and 530256 transitions. [2021-06-05 09:01:51,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-05 09:01:51,001 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 30 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 77 [2021-06-05 09:01:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:01:51,305 INFO L225 Difference]: With dead ends: 178283 [2021-06-05 09:01:51,305 INFO L226 Difference]: Without dead ends: 177539 [2021-06-05 09:01:51,305 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 13771.9ms TimeCoverageRelationStatistics Valid=406, Invalid=3884, Unknown=0, NotChecked=0, Total=4290 [2021-06-05 09:01:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177539 states. [2021-06-05 09:01:53,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177539 to 137585. [2021-06-05 09:01:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137585 states, 137582 states have (on average 2.995486328153392) internal successors, (412125), 137584 states have internal predecessors, (412125), 0 states have call successors, (0), 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 09:01:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137585 states to 137585 states and 412125 transitions. [2021-06-05 09:01:54,217 INFO L78 Accepts]: Start accepts. Automaton has 137585 states and 412125 transitions. Word has length 77 [2021-06-05 09:01:54,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:01:54,217 INFO L482 AbstractCegarLoop]: Abstraction has 137585 states and 412125 transitions. [2021-06-05 09:01:54,217 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 30 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 09:01:54,217 INFO L276 IsEmpty]: Start isEmpty. Operand 137585 states and 412125 transitions. [2021-06-05 09:01:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 09:01:54,313 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:01:54,313 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 09:01:54,516 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable502 [2021-06-05 09:01:54,517 INFO L430 AbstractCegarLoop]: === Iteration 60 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:01:54,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:01:54,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1580387411, now seen corresponding path program 31 times [2021-06-05 09:01:54,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:01:54,517 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541123439] [2021-06-05 09:01:54,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:01:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:01:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:01:54,681 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:01:54,681 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541123439] [2021-06-05 09:01:54,681 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541123439] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:01:54,681 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982460613] [2021-06-05 09:01:54,681 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 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 09:01:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:01:54,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 60 conjunts are in the unsatisfiable core [2021-06-05 09:01:54,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:01:54,770 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 09:01:54,771 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:54,775 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:54,775 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:01:54,775 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:01:54,820 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-06-05 09:01:54,820 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 09:01:54,821 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:54,825 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:54,826 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:01:54,826 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2021-06-05 09:01:54,865 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-06-05 09:01:54,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2021-06-05 09:01:54,866 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:54,874 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:54,875 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 09:01:54,875 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:30 [2021-06-05 09:01:54,922 INFO L354 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2021-06-05 09:01:54,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 09:01:54,924 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:54,933 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:54,935 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 09:01:54,935 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:18 [2021-06-05 09:01:54,978 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 13 treesize of output 9 [2021-06-05 09:01:54,978 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:54,986 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:54,987 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:01:54,987 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2021-06-05 09:01:55,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2021-06-05 09:01:55,023 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:55,032 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:55,033 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:01:55,034 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2021-06-05 09:01:55,085 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 09:01:55,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 38 [2021-06-05 09:01:55,086 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:55,100 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:55,106 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:01:55,107 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:49, output treesize:17 [2021-06-05 09:01:55,549 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 09:01:55,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, 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 09:01:55,551 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:55,571 INFO L354 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2021-06-05 09:01:55,571 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 43 treesize of output 25 [2021-06-05 09:01:55,572 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:55,586 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:55,588 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2021-06-05 09:01:55,588 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:47 [2021-06-05 09:01:55,715 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 09:01:55,715 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:01:55,716 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:01:55,717 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 09:01:55,717 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 09:01:55,736 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:01:55,736 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982460613] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:01:55,736 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:01:55,736 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 30 [2021-06-05 09:01:55,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908329805] [2021-06-05 09:01:55,736 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 09:01:55,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:01:55,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 09:01:55,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2021-06-05 09:01:55,737 INFO L87 Difference]: Start difference. First operand 137585 states and 412125 transitions. Second operand has 30 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 30 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 09:02:15,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:02:15,630 INFO L93 Difference]: Finished difference Result 181281 states and 537378 transitions. [2021-06-05 09:02:15,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-06-05 09:02:15,631 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 30 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 77 [2021-06-05 09:02:15,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:02:15,947 INFO L225 Difference]: With dead ends: 181281 [2021-06-05 09:02:15,947 INFO L226 Difference]: Without dead ends: 180345 [2021-06-05 09:02:15,947 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 2565.0ms TimeCoverageRelationStatistics Valid=721, Invalid=5131, Unknown=0, NotChecked=0, Total=5852 [2021-06-05 09:02:16,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180345 states. [2021-06-05 09:02:18,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180345 to 138801. [2021-06-05 09:02:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138801 states, 138798 states have (on average 2.996693035922708) internal successors, (415935), 138800 states have internal predecessors, (415935), 0 states have call successors, (0), 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 09:02:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138801 states to 138801 states and 415935 transitions. [2021-06-05 09:02:18,895 INFO L78 Accepts]: Start accepts. Automaton has 138801 states and 415935 transitions. Word has length 77 [2021-06-05 09:02:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:02:18,895 INFO L482 AbstractCegarLoop]: Abstraction has 138801 states and 415935 transitions. [2021-06-05 09:02:18,895 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 3.3666666666666667) internal successors, (101), 30 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 09:02:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 138801 states and 415935 transitions. [2021-06-05 09:02:19,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 09:02:19,396 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:02:19,396 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 09:02:19,614 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable552 [2021-06-05 09:02:19,615 INFO L430 AbstractCegarLoop]: === Iteration 61 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:02:19,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:02:19,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1240326497, now seen corresponding path program 32 times [2021-06-05 09:02:19,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:02:19,615 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871401784] [2021-06-05 09:02:19,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:02:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:02:19,913 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:02:19,913 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:02:19,913 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871401784] [2021-06-05 09:02:19,913 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871401784] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:02:19,913 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563406317] [2021-06-05 09:02:19,914 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 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 09:02:19,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 09:02:19,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:02:19,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 78 conjunts are in the unsatisfiable core [2021-06-05 09:02:19,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:02:20,000 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 09:02:20,001 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:20,005 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:02:20,005 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:02:20,005 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:02:20,020 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:02:20,021 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 09:02:20,022 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:20,025 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:02:20,026 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:02:20,026 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 09:02:20,081 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 09:02:20,081 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:20,087 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:02:20,088 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:02:20,088 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2021-06-05 09:02:20,123 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:02:20,123 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 09:02:20,125 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:20,133 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:02:20,134 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 09:02:20,134 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2021-06-05 09:02:20,192 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 09:02:20,192 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 09:02:20,193 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:20,206 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:02:20,208 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 09:02:20,208 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:44 [2021-06-05 09:02:20,262 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 09:02:20,263 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 09:02:20,264 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:20,279 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:02:20,280 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 09:02:20,281 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:32 [2021-06-05 09:02:20,315 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 13 treesize of output 9 [2021-06-05 09:02:20,316 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:20,328 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:02:20,328 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:02:20,329 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2021-06-05 09:02:20,426 INFO L354 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2021-06-05 09:02:20,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2021-06-05 09:02:20,428 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:20,460 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.0 percent of original size [2021-06-05 09:02:20,463 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:02:20,463 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2021-06-05 09:02:20,750 INFO L354 Elim1Store]: treesize reduction 48, result has 38.5 percent of original size [2021-06-05 09:02:20,750 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 4 case distinctions, treesize of input 56 treesize of output 45 [2021-06-05 09:02:20,751 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:20,801 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:02:20,813 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 09:02:20,813 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 1 case distinctions, treesize of input 32 treesize of output 30 [2021-06-05 09:02:20,815 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:20,835 INFO L354 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2021-06-05 09:02:20,835 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 2 case distinctions, treesize of input 56 treesize of output 34 [2021-06-05 09:02:20,837 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:20,913 INFO L628 ElimStorePlain]: treesize reduction 8, result has 94.6 percent of original size [2021-06-05 09:02:20,932 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2021-06-05 09:02:20,932 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:190, output treesize:139 [2021-06-05 09:02:21,139 INFO L354 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2021-06-05 09:02:21,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 54 [2021-06-05 09:02:21,140 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:21,177 INFO L354 Elim1Store]: treesize reduction 52, result has 40.2 percent of original size [2021-06-05 09:02:21,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 5 case distinctions, treesize of input 39 treesize of output 60 [2021-06-05 09:02:21,179 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:21,226 INFO L354 Elim1Store]: treesize reduction 72, result has 39.0 percent of original size [2021-06-05 09:02:21,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 74 [2021-06-05 09:02:21,228 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:21,290 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:02:21,374 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2021-06-05 09:02:21,374 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 9 variables, input treesize:172, output treesize:205 [2021-06-05 09:02:21,958 WARN L205 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2021-06-05 09:02:32,213 WARN L205 SmtUtils]: Spent 9.05 s on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2021-06-05 09:02:38,406 INFO L446 ElimStorePlain]: Different costs {1=[v_prenex_128, v_prenex_133], 3=[|#memory_int|, v_prenex_130]} [2021-06-05 09:02:38,425 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:02:38,425 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 09:02:38,426 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:38,466 INFO L628 ElimStorePlain]: treesize reduction 4, result has 96.6 percent of original size [2021-06-05 09:02:38,473 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:02:38,473 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 28 treesize of output 16 [2021-06-05 09:02:38,474 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:38,492 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:02:38,503 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-06-05 09:02:38,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 23 [2021-06-05 09:02:38,505 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:38,521 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:02:38,525 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-06-05 09:02:38,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 33 treesize of output 13 [2021-06-05 09:02:38,526 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 09:02:38,539 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:02:38,541 INFO L550 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:02:38,541 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 14 variables, input treesize:131, output treesize:7 [2021-06-05 09:02:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:02:38,566 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563406317] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:02:38,566 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:02:38,566 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 34 [2021-06-05 09:02:38,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37199924] [2021-06-05 09:02:38,567 INFO L462 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-06-05 09:02:38,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:02:38,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-06-05 09:02:38,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1011, Unknown=1, NotChecked=0, Total=1122 [2021-06-05 09:02:38,567 INFO L87 Difference]: Start difference. First operand 138801 states and 415935 transitions. Second operand has 34 states, 34 states have (on average 3.5588235294117645) internal successors, (121), 34 states have internal predecessors, (121), 0 states have call successors, (0), 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 09:02:48,123 WARN L205 SmtUtils]: Spent 4.06 s on a formula simplification that was a NOOP. DAG size: 88 [2021-06-05 09:02:50,210 WARN L205 SmtUtils]: Spent 786.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-06-05 09:02:54,324 WARN L205 SmtUtils]: Spent 4.08 s on a formula simplification that was a NOOP. DAG size: 92 [2021-06-05 09:02:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:02:57,299 INFO L93 Difference]: Finished difference Result 172923 states and 513904 transitions. [2021-06-05 09:02:57,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-06-05 09:02:57,300 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.5588235294117645) internal successors, (121), 34 states have internal predecessors, (121), 0 states have call successors, (0), 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 77 [2021-06-05 09:02:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:02:57,608 INFO L225 Difference]: With dead ends: 172923 [2021-06-05 09:02:57,608 INFO L226 Difference]: Without dead ends: 172707 [2021-06-05 09:02:57,609 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1839 ImplicationChecksByTransitivity, 28037.9ms TimeCoverageRelationStatistics Valid=535, Invalid=5014, Unknown=1, NotChecked=0, Total=5550 [2021-06-05 09:02:58,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172707 states. [2021-06-05 09:03:00,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172707 to 140579. [2021-06-05 09:03:00,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140579 states, 140576 states have (on average 2.9983852151149555) internal successors, (421501), 140578 states have internal predecessors, (421501), 0 states have call successors, (0), 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 09:03:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140579 states to 140579 states and 421501 transitions. [2021-06-05 09:03:00,942 INFO L78 Accepts]: Start accepts. Automaton has 140579 states and 421501 transitions. Word has length 77 [2021-06-05 09:03:00,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:03:00,942 INFO L482 AbstractCegarLoop]: Abstraction has 140579 states and 421501 transitions. [2021-06-05 09:03:00,943 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 3.5588235294117645) internal successors, (121), 34 states have internal predecessors, (121), 0 states have call successors, (0), 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 09:03:00,943 INFO L276 IsEmpty]: Start isEmpty. Operand 140579 states and 421501 transitions. [2021-06-05 09:03:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 09:03:01,099 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:03:01,099 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 09:03:01,300 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable558,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:03:01,300 INFO L430 AbstractCegarLoop]: === Iteration 62 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:03:01,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:03:01,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1318607055, now seen corresponding path program 33 times [2021-06-05 09:03:01,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:03:01,301 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951084619] [2021-06-05 09:03:01,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:03:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:03:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:03:01,474 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:03:01,474 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951084619] [2021-06-05 09:03:01,474 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951084619] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:03:01,474 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354980962] [2021-06-05 09:03:01,474 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 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 09:03:01,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:03:01,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:03:01,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 51 conjunts are in the unsatisfiable core [2021-06-05 09:03:01,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:03:01,557 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 09:03:01,558 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:01,563 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:01,563 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:03:01,563 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:03:01,579 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:03:01,579 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 09:03:01,581 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:01,585 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:01,586 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:03:01,586 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 09:03:01,670 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 09:03:01,671 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:01,678 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:01,679 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:03:01,679 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 09:03:01,722 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 09:03:01,722 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:01,728 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:01,729 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 09:03:01,729 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:14 [2021-06-05 09:03:01,768 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-06-05 09:03:01,768 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 1 case distinctions, treesize of input 27 treesize of output 15 [2021-06-05 09:03:01,769 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:01,786 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:01,790 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 09:03:01,791 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:01,807 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:01,807 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:03:01,808 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:44 [2021-06-05 09:03:01,931 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 09:03:01,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2021-06-05 09:03:01,933 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:01,951 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 09:03:01,952 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 1 case distinctions, treesize of input 26 treesize of output 29 [2021-06-05 09:03:01,953 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:01,981 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:01,987 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:03:01,988 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:74, output treesize:22 [2021-06-05 09:03:02,045 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 09:03:02,046 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:02,047 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:02,047 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 09:03:02,047 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2021-06-05 09:03:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:03:02,065 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354980962] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:03:02,066 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:03:02,066 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2021-06-05 09:03:02,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633694213] [2021-06-05 09:03:02,066 INFO L462 AbstractCegarLoop]: Interpolant automaton has 24 states [2021-06-05 09:03:02,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:03:02,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-06-05 09:03:02,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2021-06-05 09:03:02,066 INFO L87 Difference]: Start difference. First operand 140579 states and 421501 transitions. Second operand has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 24 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 09:03:04,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:03:04,958 INFO L93 Difference]: Finished difference Result 174412 states and 518535 transitions. [2021-06-05 09:03:04,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 09:03:04,958 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 24 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 77 [2021-06-05 09:03:04,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:03:05,265 INFO L225 Difference]: With dead ends: 174412 [2021-06-05 09:03:05,265 INFO L226 Difference]: Without dead ends: 174232 [2021-06-05 09:03:05,265 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1016.7ms TimeCoverageRelationStatistics Valid=246, Invalid=1646, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 09:03:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174232 states. [2021-06-05 09:03:08,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174232 to 144775. [2021-06-05 09:03:08,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144775 states, 144772 states have (on average 3.0023968723233776) internal successors, (434663), 144774 states have internal predecessors, (434663), 0 states have call successors, (0), 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 09:03:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144775 states to 144775 states and 434663 transitions. [2021-06-05 09:03:08,602 INFO L78 Accepts]: Start accepts. Automaton has 144775 states and 434663 transitions. Word has length 77 [2021-06-05 09:03:08,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:03:08,602 INFO L482 AbstractCegarLoop]: Abstraction has 144775 states and 434663 transitions. [2021-06-05 09:03:08,602 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 24 states, 24 states have (on average 4.083333333333333) internal successors, (98), 24 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 09:03:08,602 INFO L276 IsEmpty]: Start isEmpty. Operand 144775 states and 434663 transitions. [2021-06-05 09:03:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 09:03:08,714 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:03:08,714 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 09:03:08,930 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable657 [2021-06-05 09:03:08,930 INFO L430 AbstractCegarLoop]: === Iteration 63 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:03:08,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:03:08,931 INFO L82 PathProgramCache]: Analyzing trace with hash -2030883449, now seen corresponding path program 34 times [2021-06-05 09:03:08,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:03:08,931 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343609558] [2021-06-05 09:03:08,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:03:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:03:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:03:09,099 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:03:09,099 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343609558] [2021-06-05 09:03:09,099 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343609558] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:03:09,099 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366949820] [2021-06-05 09:03:09,099 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 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 09:03:09,164 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:03:09,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:03:09,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 41 conjunts are in the unsatisfiable core [2021-06-05 09:03:09,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:03:09,192 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 09:03:09,193 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:09,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:09,201 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:03:09,201 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 09:03:09,230 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:03:09,230 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 09:03:09,232 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:09,235 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:09,235 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:03:09,235 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2021-06-05 09:03:09,757 WARN L205 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-06-05 09:03:09,779 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 16 treesize of output 8 [2021-06-05 09:03:09,780 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:09,787 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:09,787 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 09:03:09,787 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:15 [2021-06-05 09:03:09,842 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 09:03:09,843 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 1 case distinctions, treesize of input 27 treesize of output 19 [2021-06-05 09:03:09,844 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:09,867 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:09,871 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 09:03:09,872 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:09,893 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:09,896 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 09:03:09,896 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:49 [2021-06-05 09:03:10,112 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 09:03:10,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2021-06-05 09:03:10,113 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:10,125 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:10,128 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:03:10,129 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:34, output treesize:12 [2021-06-05 09:03:10,154 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 16 treesize of output 8 [2021-06-05 09:03:10,155 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:10,156 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:10,157 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 09:03:10,157 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2021-06-05 09:03:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:03:10,159 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366949820] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 09:03:10,159 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 09:03:10,159 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 25 [2021-06-05 09:03:10,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414528290] [2021-06-05 09:03:10,160 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 09:03:10,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:03:10,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 09:03:10,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2021-06-05 09:03:10,160 INFO L87 Difference]: Start difference. First operand 144775 states and 434663 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 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 09:03:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:03:13,271 INFO L93 Difference]: Finished difference Result 236011 states and 703488 transitions. [2021-06-05 09:03:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-06-05 09:03:13,271 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 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 77 [2021-06-05 09:03:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:03:13,701 INFO L225 Difference]: With dead ends: 236011 [2021-06-05 09:03:13,701 INFO L226 Difference]: Without dead ends: 235891 [2021-06-05 09:03:13,701 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1657.7ms TimeCoverageRelationStatistics Valid=355, Invalid=2095, Unknown=0, NotChecked=0, Total=2450 [2021-06-05 09:03:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235891 states. [2021-06-05 09:03:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235891 to 145169. [2021-06-05 09:03:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145169 states, 145166 states have (on average 3.0048978410922667) internal successors, (436209), 145168 states have internal predecessors, (436209), 0 states have call successors, (0), 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 09:03:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145169 states to 145169 states and 436209 transitions. [2021-06-05 09:03:17,654 INFO L78 Accepts]: Start accepts. Automaton has 145169 states and 436209 transitions. Word has length 77 [2021-06-05 09:03:17,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:03:17,654 INFO L482 AbstractCegarLoop]: Abstraction has 145169 states and 436209 transitions. [2021-06-05 09:03:17,654 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 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 09:03:17,654 INFO L276 IsEmpty]: Start isEmpty. Operand 145169 states and 436209 transitions. [2021-06-05 09:03:17,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 09:03:17,763 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:03:17,763 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 09:03:17,976 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable660,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:03:17,977 INFO L430 AbstractCegarLoop]: === Iteration 64 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:03:17,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:03:17,977 INFO L82 PathProgramCache]: Analyzing trace with hash -160534643, now seen corresponding path program 17 times [2021-06-05 09:03:17,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:03:17,977 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464478554] [2021-06-05 09:03:17,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:03:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:03:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:03:18,164 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:03:18,164 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464478554] [2021-06-05 09:03:18,164 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464478554] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:03:18,164 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038441811] [2021-06-05 09:03:18,165 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 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 09:03:18,233 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 09:03:18,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:03:18,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 55 conjunts are in the unsatisfiable core [2021-06-05 09:03:18,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:03:18,261 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 09:03:18,262 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:18,266 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:18,267 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:03:18,267 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:03:18,296 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:03:18,296 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 09:03:18,297 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:18,302 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:18,302 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:03:18,302 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 09:03:18,408 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 09:03:18,408 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:18,417 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:18,418 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:03:18,418 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2021-06-05 09:03:18,473 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 09:03:18,474 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 26 [2021-06-05 09:03:18,475 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:18,491 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:18,493 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 09:03:18,493 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2021-06-05 09:03:18,666 INFO L354 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2021-06-05 09:03:18,666 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 2 case distinctions, treesize of input 43 treesize of output 33 [2021-06-05 09:03:18,667 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:18,679 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:18,684 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 09:03:18,684 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:26 [2021-06-05 09:03:18,764 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 09:03:18,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 09:03:18,765 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:18,770 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 09:03:18,771 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:18,791 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:18,796 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:03:18,796 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:23 [2021-06-05 09:03:18,840 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 09:03:18,841 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:18,846 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:18,848 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 09:03:18,849 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:18,853 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:18,854 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 09:03:18,854 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2021-06-05 09:03:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:03:18,877 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038441811] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:03:18,877 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:03:18,877 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2021-06-05 09:03:18,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942716563] [2021-06-05 09:03:18,877 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 09:03:18,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:03:18,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 09:03:18,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2021-06-05 09:03:18,878 INFO L87 Difference]: Start difference. First operand 145169 states and 436209 transitions. Second operand has 28 states, 28 states have (on average 4.5) internal successors, (126), 28 states have internal predecessors, (126), 0 states have call successors, (0), 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 09:03:25,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:03:25,813 INFO L93 Difference]: Finished difference Result 255305 states and 757378 transitions. [2021-06-05 09:03:25,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2021-06-05 09:03:25,814 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.5) internal successors, (126), 28 states have internal predecessors, (126), 0 states have call successors, (0), 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 77 [2021-06-05 09:03:25,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:03:26,273 INFO L225 Difference]: With dead ends: 255305 [2021-06-05 09:03:26,273 INFO L226 Difference]: Without dead ends: 252449 [2021-06-05 09:03:26,274 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3378 ImplicationChecksByTransitivity, 2561.2ms TimeCoverageRelationStatistics Valid=1372, Invalid=8528, Unknown=0, NotChecked=0, Total=9900 [2021-06-05 09:03:27,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252449 states. [2021-06-05 09:03:29,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252449 to 136491. [2021-06-05 09:03:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136491 states, 136488 states have (on average 2.9982342770060373) internal successors, (409223), 136490 states have internal predecessors, (409223), 0 states have call successors, (0), 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 09:03:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136491 states to 136491 states and 409223 transitions. [2021-06-05 09:03:30,314 INFO L78 Accepts]: Start accepts. Automaton has 136491 states and 409223 transitions. Word has length 77 [2021-06-05 09:03:30,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:03:30,314 INFO L482 AbstractCegarLoop]: Abstraction has 136491 states and 409223 transitions. [2021-06-05 09:03:30,314 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 4.5) internal successors, (126), 28 states have internal predecessors, (126), 0 states have call successors, (0), 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 09:03:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 136491 states and 409223 transitions. [2021-06-05 09:03:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 09:03:30,409 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:03:30,409 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 09:03:30,612 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable665,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:03:30,613 INFO L430 AbstractCegarLoop]: === Iteration 65 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:03:30,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:03:30,613 INFO L82 PathProgramCache]: Analyzing trace with hash 267666865, now seen corresponding path program 18 times [2021-06-05 09:03:30,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:03:30,613 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015527207] [2021-06-05 09:03:30,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:03:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:03:30,968 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:03:30,968 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:03:30,968 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015527207] [2021-06-05 09:03:30,968 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015527207] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:03:30,968 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282599302] [2021-06-05 09:03:30,968 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 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 09:03:31,063 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 09:03:31,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:03:31,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 60 conjunts are in the unsatisfiable core [2021-06-05 09:03:31,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:03:31,087 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 09:03:31,088 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:31,093 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:31,094 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:03:31,094 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:03:31,130 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:03:31,130 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 09:03:31,132 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:31,139 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:31,139 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:03:31,139 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 09:03:31,295 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 09:03:31,296 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:31,308 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:31,308 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:03:31,309 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2021-06-05 09:03:31,365 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 09:03:31,366 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 09:03:31,367 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:31,378 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:31,380 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:03:31,380 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:32 [2021-06-05 09:03:31,682 INFO L446 ElimStorePlain]: Different costs {4=[v_prenex_142], 9=[v_prenex_145, |v_#memory_int_221|]} [2021-06-05 09:03:31,725 INFO L354 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2021-06-05 09:03:31,726 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 2 case distinctions, treesize of input 43 treesize of output 33 [2021-06-05 09:03:31,727 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:31,788 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:31,835 INFO L354 Elim1Store]: treesize reduction 81, result has 28.9 percent of original size [2021-06-05 09:03:31,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 46 [2021-06-05 09:03:31,836 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:31,891 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:31,907 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 09:03:31,907 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 09:03:31,908 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:31,935 INFO L354 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2021-06-05 09:03:31,936 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 3 case distinctions, treesize of input 26 treesize of output 40 [2021-06-05 09:03:31,937 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:31,995 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:32,016 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 09:03:32,016 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:179, output treesize:146 [2021-06-05 09:03:32,807 WARN L205 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 25 [2021-06-05 09:03:32,930 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 09:03:32,930 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 1 case distinctions, treesize of input 26 treesize of output 29 [2021-06-05 09:03:32,932 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:32,960 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 09:03:32,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2021-06-05 09:03:32,961 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:32,986 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 09:03:32,986 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2021-06-05 09:03:32,987 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:33,036 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:33,045 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-06-05 09:03:33,046 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:114, output treesize:36 [2021-06-05 09:03:33,138 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 09:03:33,139 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:33,145 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:33,146 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 09:03:33,147 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:33,150 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:33,151 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 09:03:33,151 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2021-06-05 09:03:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:03:33,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282599302] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:03:33,178 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:03:33,178 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2021-06-05 09:03:33,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319742257] [2021-06-05 09:03:33,178 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 09:03:33,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:03:33,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 09:03:33,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2021-06-05 09:03:33,179 INFO L87 Difference]: Start difference. First operand 136491 states and 409223 transitions. Second operand has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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 09:03:35,755 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-06-05 09:03:38,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:03:38,740 INFO L93 Difference]: Finished difference Result 188867 states and 560973 transitions. [2021-06-05 09:03:38,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2021-06-05 09:03:38,740 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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 77 [2021-06-05 09:03:38,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:03:39,069 INFO L225 Difference]: With dead ends: 188867 [2021-06-05 09:03:39,069 INFO L226 Difference]: Without dead ends: 188603 [2021-06-05 09:03:39,069 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1669 ImplicationChecksByTransitivity, 3118.0ms TimeCoverageRelationStatistics Valid=460, Invalid=4652, Unknown=0, NotChecked=0, Total=5112 [2021-06-05 09:03:39,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188603 states. [2021-06-05 09:03:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188603 to 141389. [2021-06-05 09:03:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141389 states, 141386 states have (on average 3.0016196794590697) internal successors, (424387), 141388 states have internal predecessors, (424387), 0 states have call successors, (0), 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 09:03:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141389 states to 141389 states and 424387 transitions. [2021-06-05 09:03:42,174 INFO L78 Accepts]: Start accepts. Automaton has 141389 states and 424387 transitions. Word has length 77 [2021-06-05 09:03:42,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:03:42,174 INFO L482 AbstractCegarLoop]: Abstraction has 141389 states and 424387 transitions. [2021-06-05 09:03:42,174 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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 09:03:42,174 INFO L276 IsEmpty]: Start isEmpty. Operand 141389 states and 424387 transitions. [2021-06-05 09:03:42,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 09:03:42,690 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:03:42,690 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 09:03:42,905 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable674 [2021-06-05 09:03:42,906 INFO L430 AbstractCegarLoop]: === Iteration 66 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:03:42,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:03:42,906 INFO L82 PathProgramCache]: Analyzing trace with hash 144687451, now seen corresponding path program 19 times [2021-06-05 09:03:42,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:03:42,906 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647552249] [2021-06-05 09:03:42,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:03:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:03:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:03:43,154 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:03:43,154 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647552249] [2021-06-05 09:03:43,154 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647552249] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:03:43,154 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287138079] [2021-06-05 09:03:43,154 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 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 09:03:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:03:43,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 60 conjunts are in the unsatisfiable core [2021-06-05 09:03:43,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:03:43,238 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 09:03:43,239 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:43,243 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:43,244 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:03:43,244 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:03:43,260 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:03:43,260 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 09:03:43,262 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:43,266 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:43,267 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:03:43,267 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 09:03:43,385 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 13 treesize of output 9 [2021-06-05 09:03:43,386 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:43,396 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:43,397 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:03:43,397 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2021-06-05 09:03:43,461 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 09:03:43,461 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 09:03:43,462 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:43,474 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:43,476 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:03:43,476 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:32 [2021-06-05 09:03:43,769 INFO L446 ElimStorePlain]: Different costs {4=[v_prenex_151], 9=[|v_#memory_int_225|]} [2021-06-05 09:03:43,815 INFO L354 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2021-06-05 09:03:43,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 2 case distinctions, treesize of input 43 treesize of output 33 [2021-06-05 09:03:43,816 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:43,835 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 09:03:43,835 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 09:03:43,836 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:43,892 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:43,946 INFO L354 Elim1Store]: treesize reduction 81, result has 28.9 percent of original size [2021-06-05 09:03:43,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 46 [2021-06-05 09:03:43,948 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:43,981 INFO L354 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2021-06-05 09:03:43,981 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 3 case distinctions, treesize of input 26 treesize of output 40 [2021-06-05 09:03:43,982 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:44,046 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:44,067 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 09:03:44,067 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:179, output treesize:146 [2021-06-05 09:03:47,387 WARN L205 SmtUtils]: Spent 3.24 s on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2021-06-05 09:03:47,640 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 09:03:47,640 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 1 case distinctions, treesize of input 26 treesize of output 29 [2021-06-05 09:03:47,641 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:47,664 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 09:03:47,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2021-06-05 09:03:47,666 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:47,671 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 26 treesize of output 21 [2021-06-05 09:03:47,672 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:47,709 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:47,715 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-06-05 09:03:47,716 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:107, output treesize:40 [2021-06-05 09:03:47,797 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 09:03:47,798 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:47,803 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:47,805 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 09:03:47,806 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:03:47,809 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:03:47,809 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 09:03:47,810 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2021-06-05 09:03:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:03:47,841 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287138079] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:03:47,841 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:03:47,841 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 29 [2021-06-05 09:03:47,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18895909] [2021-06-05 09:03:47,841 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 09:03:47,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:03:47,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 09:03:47,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2021-06-05 09:03:47,842 INFO L87 Difference]: Start difference. First operand 141389 states and 424387 transitions. Second operand has 29 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 29 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 09:03:52,139 WARN L205 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2021-06-05 09:03:53,820 WARN L205 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2021-06-05 09:03:55,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:03:55,996 INFO L93 Difference]: Finished difference Result 187249 states and 559283 transitions. [2021-06-05 09:03:55,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-05 09:03:55,997 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 29 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 77 [2021-06-05 09:03:55,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:03:56,332 INFO L225 Difference]: With dead ends: 187249 [2021-06-05 09:03:56,332 INFO L226 Difference]: Without dead ends: 187057 [2021-06-05 09:03:56,332 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 9343.8ms TimeCoverageRelationStatistics Valid=266, Invalid=2184, Unknown=0, NotChecked=0, Total=2450 [2021-06-05 09:03:57,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187057 states. [2021-06-05 09:03:59,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187057 to 145027. [2021-06-05 09:03:59,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145027 states, 145024 states have (on average 3.00421309576346) internal successors, (435683), 145026 states have internal predecessors, (435683), 0 states have call successors, (0), 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 09:03:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145027 states to 145027 states and 435683 transitions. [2021-06-05 09:03:59,737 INFO L78 Accepts]: Start accepts. Automaton has 145027 states and 435683 transitions. Word has length 77 [2021-06-05 09:03:59,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:03:59,738 INFO L482 AbstractCegarLoop]: Abstraction has 145027 states and 435683 transitions. [2021-06-05 09:03:59,738 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 3.4827586206896552) internal successors, (101), 29 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 09:03:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand 145027 states and 435683 transitions. [2021-06-05 09:03:59,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 09:03:59,846 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:03:59,846 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 09:04:00,047 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable709,46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:04:00,047 INFO L430 AbstractCegarLoop]: === Iteration 67 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:04:00,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:04:00,047 INFO L82 PathProgramCache]: Analyzing trace with hash 858771829, now seen corresponding path program 35 times [2021-06-05 09:04:00,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:04:00,048 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369960832] [2021-06-05 09:04:00,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:04:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:04:00,359 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:04:00,359 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:04:00,360 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369960832] [2021-06-05 09:04:00,360 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369960832] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:04:00,360 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350563865] [2021-06-05 09:04:00,360 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 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 09:04:00,431 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-06-05 09:04:00,432 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:04:00,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 58 conjunts are in the unsatisfiable core [2021-06-05 09:04:00,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:04:00,451 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 09:04:00,452 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:00,457 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:00,457 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:04:00,457 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:04:00,504 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:04:00,504 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 09:04:00,505 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:00,511 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:00,512 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:04:00,512 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-06-05 09:04:00,560 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 13 treesize of output 9 [2021-06-05 09:04:00,561 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:00,570 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:00,570 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:04:00,571 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2021-06-05 09:04:00,644 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-06-05 09:04:00,644 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 1 case distinctions, treesize of input 25 treesize of output 24 [2021-06-05 09:04:00,645 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:00,656 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:00,658 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:04:00,658 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:32 [2021-06-05 09:04:00,740 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 09:04:00,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 09:04:00,741 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:00,746 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 09:04:00,747 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:00,775 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:00,779 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:04:00,779 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:72, output treesize:35 [2021-06-05 09:04:00,905 INFO L446 ElimStorePlain]: Different costs {4=[v_prenex_161, v_prenex_163], 5=[|v_#memory_int_230|]} [2021-06-05 09:04:00,936 INFO L354 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2021-06-05 09:04:00,936 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 43 treesize of output 25 [2021-06-05 09:04:00,937 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:00,974 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:01,005 INFO L354 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2021-06-05 09:04:01,006 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 43 treesize of output 33 [2021-06-05 09:04:01,007 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:01,054 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:01,070 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 09:04:01,070 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 09:04:01,071 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:01,087 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 09:04:01,087 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 09:04:01,088 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:01,132 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:01,135 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2021-06-05 09:04:01,136 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:149, output treesize:72 [2021-06-05 09:04:01,403 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 09:04:01,404 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 26 treesize of output 10 [2021-06-05 09:04:01,404 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:01,411 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:01,417 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:04:01,417 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 09:04:01,419 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:01,439 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:01,441 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 09:04:01,441 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:49, output treesize:7 [2021-06-05 09:04:01,466 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:04:01,467 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350563865] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:04:01,467 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:04:01,467 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 29 [2021-06-05 09:04:01,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929118218] [2021-06-05 09:04:01,467 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 09:04:01,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:04:01,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 09:04:01,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2021-06-05 09:04:01,467 INFO L87 Difference]: Start difference. First operand 145027 states and 435683 transitions. Second operand has 29 states, 29 states have (on average 3.4482758620689653) internal successors, (100), 29 states have internal predecessors, (100), 0 states have call successors, (0), 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 09:04:03,130 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2021-06-05 09:04:05,139 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2021-06-05 09:04:05,555 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2021-06-05 09:04:06,563 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 66 [2021-06-05 09:04:08,154 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2021-06-05 09:04:08,445 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2021-06-05 09:04:09,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:04:09,626 INFO L93 Difference]: Finished difference Result 206217 states and 612831 transitions. [2021-06-05 09:04:09,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-06-05 09:04:09,627 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.4482758620689653) internal successors, (100), 29 states have internal predecessors, (100), 0 states have call successors, (0), 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 77 [2021-06-05 09:04:09,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:04:10,228 INFO L225 Difference]: With dead ends: 206217 [2021-06-05 09:04:10,228 INFO L226 Difference]: Without dead ends: 205341 [2021-06-05 09:04:10,228 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1902 ImplicationChecksByTransitivity, 4494.1ms TimeCoverageRelationStatistics Valid=762, Invalid=5558, Unknown=0, NotChecked=0, Total=6320 [2021-06-05 09:04:10,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205341 states. [2021-06-05 09:04:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205341 to 149120. [2021-06-05 09:04:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149120 states, 149117 states have (on average 3.0053716209419448) internal successors, (448152), 149119 states have internal predecessors, (448152), 0 states have call successors, (0), 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 09:04:13,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149120 states to 149120 states and 448152 transitions. [2021-06-05 09:04:13,526 INFO L78 Accepts]: Start accepts. Automaton has 149120 states and 448152 transitions. Word has length 77 [2021-06-05 09:04:13,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:04:13,526 INFO L482 AbstractCegarLoop]: Abstraction has 149120 states and 448152 transitions. [2021-06-05 09:04:13,526 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 3.4482758620689653) internal successors, (100), 29 states have internal predecessors, (100), 0 states have call successors, (0), 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 09:04:13,526 INFO L276 IsEmpty]: Start isEmpty. Operand 149120 states and 448152 transitions. [2021-06-05 09:04:13,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 09:04:13,638 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:04:13,638 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 09:04:13,839 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable753 [2021-06-05 09:04:13,839 INFO L430 AbstractCegarLoop]: === Iteration 68 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:04:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:04:13,839 INFO L82 PathProgramCache]: Analyzing trace with hash 329386531, now seen corresponding path program 36 times [2021-06-05 09:04:13,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:04:13,839 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933265280] [2021-06-05 09:04:13,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:04:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:04:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:04:14,005 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:04:14,005 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933265280] [2021-06-05 09:04:14,005 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933265280] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:04:14,005 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703209621] [2021-06-05 09:04:14,005 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 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 09:04:14,074 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-06-05 09:04:14,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:04:14,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 56 conjunts are in the unsatisfiable core [2021-06-05 09:04:14,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:04:14,151 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 09:04:14,152 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:14,159 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:14,160 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:04:14,160 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2021-06-05 09:04:14,230 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 09:04:14,230 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 09:04:14,231 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:14,241 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:14,243 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:04:14,243 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:28 [2021-06-05 09:04:14,422 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:04:14,422 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 09:04:14,423 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:14,425 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 09:04:14,426 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:14,438 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:14,440 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 09:04:14,440 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:21 [2021-06-05 09:04:14,483 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 09:04:14,483 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:14,537 INFO L628 ElimStorePlain]: treesize reduction 18, result has 82.2 percent of original size [2021-06-05 09:04:14,537 INFO L518 ElimStorePlain]: Eliminatee v_prenex_168 vanished before elimination [2021-06-05 09:04:14,555 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 09:04:14,555 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 1 case distinctions, treesize of input 27 treesize of output 19 [2021-06-05 09:04:14,556 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:14,580 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:14,592 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-06-05 09:04:14,592 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 15 [2021-06-05 09:04:14,593 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:14,632 INFO L628 ElimStorePlain]: treesize reduction 4, result has 93.4 percent of original size [2021-06-05 09:04:14,633 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-06-05 09:04:14,633 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:105, output treesize:57 [2021-06-05 09:04:15,243 INFO L446 ElimStorePlain]: Different costs {0=[v_prenex_173], 1=[|#memory_int|]} [2021-06-05 09:04:15,245 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 09:04:15,246 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:15,254 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:15,260 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:04:15,260 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 09:04:15,262 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:15,268 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:15,269 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:04:15,269 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:7 [2021-06-05 09:04:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:04:15,293 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703209621] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:04:15,293 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:04:15,293 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 25 [2021-06-05 09:04:15,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026258372] [2021-06-05 09:04:15,293 INFO L462 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-06-05 09:04:15,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:04:15,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-06-05 09:04:15,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2021-06-05 09:04:15,294 INFO L87 Difference]: Start difference. First operand 149120 states and 448152 transitions. Second operand has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 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 09:04:18,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:04:18,935 INFO L93 Difference]: Finished difference Result 237529 states and 709081 transitions. [2021-06-05 09:04:18,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 09:04:18,936 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 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 77 [2021-06-05 09:04:18,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:04:19,378 INFO L225 Difference]: With dead ends: 237529 [2021-06-05 09:04:19,379 INFO L226 Difference]: Without dead ends: 237337 [2021-06-05 09:04:19,379 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1529.1ms TimeCoverageRelationStatistics Valid=192, Invalid=1368, Unknown=0, NotChecked=0, Total=1560 [2021-06-05 09:04:20,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237337 states. [2021-06-05 09:04:22,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237337 to 148586. [2021-06-05 09:04:22,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148586 states, 148583 states have (on average 3.0042198636452353) internal successors, (446376), 148585 states have internal predecessors, (446376), 0 states have call successors, (0), 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 09:04:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148586 states to 148586 states and 446376 transitions. [2021-06-05 09:04:23,427 INFO L78 Accepts]: Start accepts. Automaton has 148586 states and 446376 transitions. Word has length 77 [2021-06-05 09:04:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:04:23,427 INFO L482 AbstractCegarLoop]: Abstraction has 148586 states and 446376 transitions. [2021-06-05 09:04:23,427 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 25 states, 25 states have (on average 3.96) internal successors, (99), 25 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 09:04:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 148586 states and 446376 transitions. [2021-06-05 09:04:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 09:04:23,535 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:04:23,535 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 09:04:23,736 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable768,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:04:23,736 INFO L430 AbstractCegarLoop]: === Iteration 69 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:04:23,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:04:23,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1961942079, now seen corresponding path program 37 times [2021-06-05 09:04:23,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:04:23,737 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345639106] [2021-06-05 09:04:23,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:04:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:04:24,350 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:04:24,350 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:04:24,350 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345639106] [2021-06-05 09:04:24,350 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345639106] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:04:24,350 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763052372] [2021-06-05 09:04:24,350 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 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 09:04:24,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:04:24,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 69 conjunts are in the unsatisfiable core [2021-06-05 09:04:24,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:04:24,443 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 09:04:24,443 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:24,448 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:24,449 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:04:24,449 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:04:24,471 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:04:24,471 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 09:04:24,473 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:24,480 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:24,481 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:04:24,481 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2021-06-05 09:04:24,575 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 09:04:24,575 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 09:04:24,577 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:24,593 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:24,593 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:04:24,593 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:37 [2021-06-05 09:04:24,651 INFO L354 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2021-06-05 09:04:24,651 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 09:04:24,654 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:24,670 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:24,671 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:04:24,671 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:37 [2021-06-05 09:04:24,715 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 11 treesize of output 7 [2021-06-05 09:04:24,716 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:24,733 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:24,734 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:04:24,734 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2021-06-05 09:04:24,939 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 09:04:24,939 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 1 case distinctions, treesize of input 19 treesize of output 22 [2021-06-05 09:04:24,940 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:24,961 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:24,964 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:04:24,964 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:52 [2021-06-05 09:04:25,398 INFO L446 ElimStorePlain]: Different costs {4=[v_prenex_175], 9=[|v_#memory_int_236|]} [2021-06-05 09:04:25,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 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 09:04:25,410 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:25,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2021-06-05 09:04:25,421 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:25,631 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2021-06-05 09:04:25,631 INFO L628 ElimStorePlain]: treesize reduction 12, result has 94.9 percent of original size [2021-06-05 09:04:25,661 INFO L354 Elim1Store]: treesize reduction 36, result has 28.0 percent of original size [2021-06-05 09:04:25,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 42 [2021-06-05 09:04:25,663 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:25,683 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-06-05 09:04:25,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2021-06-05 09:04:25,684 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:25,867 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2021-06-05 09:04:25,867 INFO L628 ElimStorePlain]: treesize reduction 4, result has 98.1 percent of original size [2021-06-05 09:04:25,872 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 09:04:25,872 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:259, output treesize:183 [2021-06-05 09:04:26,623 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-06-05 09:04:26,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2021-06-05 09:04:26,675 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:26,689 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 09:04:26,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-06-05 09:04:26,691 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:26,736 INFO L354 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2021-06-05 09:04:26,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 38 [2021-06-05 09:04:26,738 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:26,769 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 09:04:26,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2021-06-05 09:04:26,770 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:26,855 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:26,860 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 09:04:26,860 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:227, output treesize:135 [2021-06-05 09:04:27,276 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-06-05 09:04:27,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 21 [2021-06-05 09:04:27,278 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:27,295 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:27,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2021-06-05 09:04:27,299 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:27,311 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:27,313 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 09:04:27,313 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:79, output treesize:7 [2021-06-05 09:04:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:04:27,340 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763052372] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:04:27,340 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:04:27,341 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2021-06-05 09:04:27,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016606215] [2021-06-05 09:04:27,341 INFO L462 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-06-05 09:04:27,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:04:27,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-06-05 09:04:27,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2021-06-05 09:04:27,341 INFO L87 Difference]: Start difference. First operand 148586 states and 446376 transitions. Second operand has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 0 states have call successors, (0), 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 09:04:29,770 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2021-06-05 09:04:30,281 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2021-06-05 09:04:30,790 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2021-06-05 09:04:31,435 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 82 [2021-06-05 09:04:31,911 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 67 [2021-06-05 09:04:33,247 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2021-06-05 09:04:33,541 WARN L205 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2021-06-05 09:04:34,045 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2021-06-05 09:04:36,785 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 79 [2021-06-05 09:04:36,943 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2021-06-05 09:04:37,147 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 75 [2021-06-05 09:04:37,486 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2021-06-05 09:04:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:04:40,904 INFO L93 Difference]: Finished difference Result 284848 states and 849632 transitions. [2021-06-05 09:04:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-06-05 09:04:40,904 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 0 states have call successors, (0), 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 77 [2021-06-05 09:04:40,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:04:41,491 INFO L225 Difference]: With dead ends: 284848 [2021-06-05 09:04:41,491 INFO L226 Difference]: Without dead ends: 284380 [2021-06-05 09:04:41,491 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2043 ImplicationChecksByTransitivity, 6321.6ms TimeCoverageRelationStatistics Valid=686, Invalid=5476, Unknown=0, NotChecked=0, Total=6162 [2021-06-05 09:04:42,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284380 states. [2021-06-05 09:04:45,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284380 to 170333. [2021-06-05 09:04:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170333 states, 170330 states have (on average 3.018440673985792) internal successors, (514131), 170332 states have internal predecessors, (514131), 0 states have call successors, (0), 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 09:04:46,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170333 states to 170333 states and 514131 transitions. [2021-06-05 09:04:46,402 INFO L78 Accepts]: Start accepts. Automaton has 170333 states and 514131 transitions. Word has length 77 [2021-06-05 09:04:46,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:04:46,402 INFO L482 AbstractCegarLoop]: Abstraction has 170333 states and 514131 transitions. [2021-06-05 09:04:46,402 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 3.78125) internal successors, (121), 32 states have internal predecessors, (121), 0 states have call successors, (0), 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 09:04:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 170333 states and 514131 transitions. [2021-06-05 09:04:46,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 09:04:46,535 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:04:46,535 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 09:04:46,735 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable783 [2021-06-05 09:04:46,736 INFO L430 AbstractCegarLoop]: === Iteration 70 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:04:46,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:04:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2043721303, now seen corresponding path program 38 times [2021-06-05 09:04:46,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:04:46,736 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897851328] [2021-06-05 09:04:46,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:04:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:04:47,087 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:04:47,087 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:04:47,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897851328] [2021-06-05 09:04:47,087 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897851328] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:04:47,087 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100540126] [2021-06-05 09:04:47,087 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 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 09:04:47,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 09:04:47,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:04:47,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 60 conjunts are in the unsatisfiable core [2021-06-05 09:04:47,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:04:47,172 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 09:04:47,173 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:47,178 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:47,178 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:04:47,178 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:04:47,211 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:04:47,212 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 09:04:47,213 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:47,218 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:47,218 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:04:47,218 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 09:04:47,329 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 13 treesize of output 9 [2021-06-05 09:04:47,330 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:47,339 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:47,340 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:04:47,340 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2021-06-05 09:04:47,428 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 09:04:47,428 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 09:04:47,429 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:47,440 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:47,442 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:04:47,442 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:32 [2021-06-05 09:04:47,743 INFO L446 ElimStorePlain]: Different costs {4=[|v_#memory_int_240|], 9=[v_prenex_185]} [2021-06-05 09:04:47,789 INFO L354 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2021-06-05 09:04:47,789 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 2 case distinctions, treesize of input 43 treesize of output 33 [2021-06-05 09:04:47,790 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:47,809 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 09:04:47,809 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 09:04:47,810 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:47,864 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:47,917 INFO L354 Elim1Store]: treesize reduction 81, result has 28.9 percent of original size [2021-06-05 09:04:47,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 46 [2021-06-05 09:04:47,918 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:47,949 INFO L354 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2021-06-05 09:04:47,950 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 3 case distinctions, treesize of input 26 treesize of output 40 [2021-06-05 09:04:47,951 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:48,013 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:48,033 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 09:04:48,033 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:179, output treesize:142 [2021-06-05 09:04:49,050 WARN L205 SmtUtils]: Spent 953.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 25 [2021-06-05 09:04:49,235 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 09:04:49,236 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:49,255 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 09:04:49,256 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 09:04:49,257 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:49,277 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:49,281 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:04:49,281 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:23 [2021-06-05 09:04:49,319 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 09:04:49,319 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:49,326 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:49,327 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 09:04:49,328 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:04:49,331 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:04:49,332 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 09:04:49,332 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2021-06-05 09:04:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:04:49,359 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100540126] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:04:49,359 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:04:49,359 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 31 [2021-06-05 09:04:49,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530472065] [2021-06-05 09:04:49,360 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 09:04:49,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:04:49,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 09:04:49,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=841, Unknown=0, NotChecked=0, Total=930 [2021-06-05 09:04:49,360 INFO L87 Difference]: Start difference. First operand 170333 states and 514131 transitions. Second operand has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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 09:04:55,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:04:55,762 INFO L93 Difference]: Finished difference Result 254607 states and 761782 transitions. [2021-06-05 09:04:55,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-06-05 09:04:55,762 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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 77 [2021-06-05 09:04:55,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:04:56,268 INFO L225 Difference]: With dead ends: 254607 [2021-06-05 09:04:56,268 INFO L226 Difference]: Without dead ends: 254475 [2021-06-05 09:04:56,268 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 3698.7ms TimeCoverageRelationStatistics Valid=398, Invalid=4024, Unknown=0, NotChecked=0, Total=4422 [2021-06-05 09:04:57,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254475 states. [2021-06-05 09:04:59,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254475 to 177304. [2021-06-05 09:04:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177304 states, 177301 states have (on average 3.0217596065448022) internal successors, (535761), 177303 states have internal predecessors, (535761), 0 states have call successors, (0), 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 09:05:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177304 states to 177304 states and 535761 transitions. [2021-06-05 09:05:00,433 INFO L78 Accepts]: Start accepts. Automaton has 177304 states and 535761 transitions. Word has length 77 [2021-06-05 09:05:00,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:05:00,434 INFO L482 AbstractCegarLoop]: Abstraction has 177304 states and 535761 transitions. [2021-06-05 09:05:00,434 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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 09:05:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 177304 states and 535761 transitions. [2021-06-05 09:05:01,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 09:05:01,120 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:05:01,136 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 09:05:01,354 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable809 [2021-06-05 09:05:01,354 INFO L430 AbstractCegarLoop]: === Iteration 71 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:05:01,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:05:01,354 INFO L82 PathProgramCache]: Analyzing trace with hash 67910355, now seen corresponding path program 20 times [2021-06-05 09:05:01,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:05:01,354 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721350949] [2021-06-05 09:05:01,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:05:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:05:01,630 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:05:01,630 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:05:01,630 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721350949] [2021-06-05 09:05:01,630 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721350949] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:05:01,630 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898885343] [2021-06-05 09:05:01,630 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 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 09:05:01,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 09:05:01,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:05:01,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 60 conjunts are in the unsatisfiable core [2021-06-05 09:05:01,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:05:01,715 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 09:05:01,717 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:01,722 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:01,723 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:05:01,723 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:05:01,749 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:05:01,750 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 09:05:01,753 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:01,761 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:01,761 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:05:01,761 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 09:05:01,912 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 09:05:01,913 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:01,925 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:01,925 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:05:01,926 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2021-06-05 09:05:02,009 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 09:05:02,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, 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 09:05:02,010 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:02,031 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:02,033 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:05:02,033 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:32 [2021-06-05 09:05:02,359 INFO L446 ElimStorePlain]: Different costs {4=[v_prenex_192], 9=[|v_#memory_int_244|]} [2021-06-05 09:05:02,415 INFO L354 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2021-06-05 09:05:02,415 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 2 case distinctions, treesize of input 43 treesize of output 33 [2021-06-05 09:05:02,417 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:02,437 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 09:05:02,437 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 09:05:02,438 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:02,499 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:02,538 INFO L354 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2021-06-05 09:05:02,538 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 3 case distinctions, treesize of input 26 treesize of output 40 [2021-06-05 09:05:02,539 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:02,589 INFO L354 Elim1Store]: treesize reduction 81, result has 28.9 percent of original size [2021-06-05 09:05:02,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 46 [2021-06-05 09:05:02,591 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:02,654 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:02,680 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 09:05:02,680 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:179, output treesize:146 [2021-06-05 09:05:06,706 WARN L205 SmtUtils]: Spent 3.97 s on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2021-06-05 09:05:06,952 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 09:05:06,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2021-06-05 09:05:06,953 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:06,978 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-06-05 09:05:06,978 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 1 case distinctions, treesize of input 26 treesize of output 29 [2021-06-05 09:05:06,979 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:06,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 26 treesize of output 21 [2021-06-05 09:05:06,989 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:07,067 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:07,095 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2021-06-05 09:05:07,096 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:107, output treesize:40 [2021-06-05 09:05:07,190 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 09:05:07,191 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:07,196 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:07,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 09:05:07,199 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:07,202 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:07,203 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 09:05:07,203 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2021-06-05 09:05:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-06-05 09:05:07,230 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898885343] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:05:07,230 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:05:07,230 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 29 [2021-06-05 09:05:07,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673721246] [2021-06-05 09:05:07,231 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 09:05:07,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:05:07,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 09:05:07,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2021-06-05 09:05:07,231 INFO L87 Difference]: Start difference. First operand 177304 states and 535761 transitions. Second operand has 29 states, 29 states have (on average 3.4482758620689653) internal successors, (100), 29 states have internal predecessors, (100), 0 states have call successors, (0), 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 09:05:10,169 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2021-06-05 09:05:12,649 WARN L205 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2021-06-05 09:05:12,919 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2021-06-05 09:05:15,708 WARN L205 SmtUtils]: Spent 2.66 s on a formula simplification. DAG size of input: 61 DAG size of output: 27 [2021-06-05 09:05:18,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:05:18,284 INFO L93 Difference]: Finished difference Result 223146 states and 669403 transitions. [2021-06-05 09:05:18,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-06-05 09:05:18,284 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.4482758620689653) internal successors, (100), 29 states have internal predecessors, (100), 0 states have call successors, (0), 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 77 [2021-06-05 09:05:18,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:05:18,769 INFO L225 Difference]: With dead ends: 223146 [2021-06-05 09:05:18,769 INFO L226 Difference]: Without dead ends: 222882 [2021-06-05 09:05:18,770 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 12492.9ms TimeCoverageRelationStatistics Valid=333, Invalid=2859, Unknown=0, NotChecked=0, Total=3192 [2021-06-05 09:05:19,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222882 states. [2021-06-05 09:05:22,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222882 to 177766. [2021-06-05 09:05:22,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177766 states, 177763 states have (on average 3.0239307392426995) internal successors, (537543), 177765 states have internal predecessors, (537543), 0 states have call successors, (0), 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 09:05:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177766 states to 177766 states and 537543 transitions. [2021-06-05 09:05:23,057 INFO L78 Accepts]: Start accepts. Automaton has 177766 states and 537543 transitions. Word has length 77 [2021-06-05 09:05:23,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:05:23,057 INFO L482 AbstractCegarLoop]: Abstraction has 177766 states and 537543 transitions. [2021-06-05 09:05:23,058 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 3.4482758620689653) internal successors, (100), 29 states have internal predecessors, (100), 0 states have call successors, (0), 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 09:05:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 177766 states and 537543 transitions. [2021-06-05 09:05:23,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 09:05:23,209 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:05:23,209 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 09:05:23,410 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable847,51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:05:23,410 INFO L430 AbstractCegarLoop]: === Iteration 72 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:05:23,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:05:23,411 INFO L82 PathProgramCache]: Analyzing trace with hash -834968489, now seen corresponding path program 39 times [2021-06-05 09:05:23,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:05:23,411 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046115135] [2021-06-05 09:05:23,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:05:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:05:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 09:05:23,923 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:05:23,923 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046115135] [2021-06-05 09:05:23,923 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046115135] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:05:23,923 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709528540] [2021-06-05 09:05:23,923 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 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 09:05:23,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:05:23,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:05:23,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 76 conjunts are in the unsatisfiable core [2021-06-05 09:05:23,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:05:24,015 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 09:05:24,016 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:24,021 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:24,022 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:05:24,022 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:05:24,039 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:05:24,039 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 09:05:24,040 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:24,045 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:24,046 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:05:24,046 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 09:05:24,101 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 09:05:24,101 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:24,109 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:24,109 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:05:24,109 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2021-06-05 09:05:24,150 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:05:24,151 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 09:05:24,152 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:24,162 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:24,163 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 09:05:24,163 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2021-06-05 09:05:24,222 INFO L354 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2021-06-05 09:05:24,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2021-06-05 09:05:24,223 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:24,237 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:24,238 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 09:05:24,238 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:36 [2021-06-05 09:05:24,790 INFO L354 Elim1Store]: treesize reduction 28, result has 31.7 percent of original size [2021-06-05 09:05:24,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 25 [2021-06-05 09:05:24,794 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:24,824 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:24,825 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 09:05:24,825 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:28 [2021-06-05 09:05:24,864 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 09:05:24,865 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:24,879 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:24,879 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:05:24,880 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2021-06-05 09:05:25,118 INFO L354 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2021-06-05 09:05:25,118 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 3 case distinctions, treesize of input 33 treesize of output 47 [2021-06-05 09:05:25,119 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:25,145 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:25,174 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:05:25,174 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:59 [2021-06-05 09:05:25,470 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 09:05:25,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 39 [2021-06-05 09:05:25,471 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:25,520 INFO L354 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2021-06-05 09:05:25,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 28 [2021-06-05 09:05:25,540 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:25,560 INFO L354 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2021-06-05 09:05:25,561 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 1 case distinctions, treesize of input 35 treesize of output 1 [2021-06-05 09:05:25,561 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:25,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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 09:05:25,622 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:25,628 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 09:05:25,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2021-06-05 09:05:25,635 INFO L550 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:25,642 INFO L173 IndexEqualityManager]: detected equality via solver [2021-06-05 09:05:25,651 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 09:05:25,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 32 [2021-06-05 09:05:25,652 INFO L550 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:25,703 INFO L354 Elim1Store]: treesize reduction 72, result has 23.4 percent of original size [2021-06-05 09:05:25,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 38 [2021-06-05 09:05:25,705 INFO L550 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:25,823 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2021-06-05 09:05:25,823 INFO L628 ElimStorePlain]: treesize reduction 98, result has 58.1 percent of original size [2021-06-05 09:05:25,830 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2021-06-05 09:05:25,830 INFO L247 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:361, output treesize:133 [2021-06-05 09:05:29,414 WARN L205 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2021-06-05 09:05:29,506 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 09:05:29,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 09:05:29,509 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:29,537 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 09:05:29,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 09:05:29,538 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:29,582 INFO L354 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2021-06-05 09:05:29,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 54 [2021-06-05 09:05:29,584 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:29,635 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:29,657 INFO L550 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2021-06-05 09:05:29,657 INFO L247 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:119, output treesize:61 [2021-06-05 09:05:29,735 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 09:05:29,736 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:29,741 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:29,743 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 09:05:29,743 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:29,747 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:29,747 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 09:05:29,747 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2021-06-05 09:05:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 09:05:29,775 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709528540] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:05:29,775 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:05:29,775 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2021-06-05 09:05:29,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251180857] [2021-06-05 09:05:29,775 INFO L462 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-06-05 09:05:29,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:05:29,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-06-05 09:05:29,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2021-06-05 09:05:29,776 INFO L87 Difference]: Start difference. First operand 177766 states and 537543 transitions. Second operand has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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 09:05:50,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:05:50,222 INFO L93 Difference]: Finished difference Result 278622 states and 829395 transitions. [2021-06-05 09:05:50,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2021-06-05 09:05:50,222 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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 77 [2021-06-05 09:05:50,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:05:50,746 INFO L225 Difference]: With dead ends: 278622 [2021-06-05 09:05:50,746 INFO L226 Difference]: Without dead ends: 278406 [2021-06-05 09:05:50,747 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1568 ImplicationChecksByTransitivity, 7386.2ms TimeCoverageRelationStatistics Valid=665, Invalid=4447, Unknown=0, NotChecked=0, Total=5112 [2021-06-05 09:05:51,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278406 states. [2021-06-05 09:05:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278406 to 184264. [2021-06-05 09:05:54,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184264 states, 184261 states have (on average 3.026180255181509) internal successors, (557607), 184263 states have internal predecessors, (557607), 0 states have call successors, (0), 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 09:05:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184264 states to 184264 states and 557607 transitions. [2021-06-05 09:05:55,880 INFO L78 Accepts]: Start accepts. Automaton has 184264 states and 557607 transitions. Word has length 77 [2021-06-05 09:05:55,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:05:55,880 INFO L482 AbstractCegarLoop]: Abstraction has 184264 states and 557607 transitions. [2021-06-05 09:05:55,881 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 31 states have internal predecessors, (125), 0 states have call successors, (0), 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 09:05:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 184264 states and 557607 transitions. [2021-06-05 09:05:56,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 09:05:56,024 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:05:56,024 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 09:05:56,232 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable891,52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 09:05:56,233 INFO L430 AbstractCegarLoop]: === Iteration 73 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:05:56,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:05:56,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1441404737, now seen corresponding path program 21 times [2021-06-05 09:05:56,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:05:56,233 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40817811] [2021-06-05 09:05:56,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:05:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:05:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 09:05:56,560 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:05:56,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40817811] [2021-06-05 09:05:56,560 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40817811] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:05:56,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022389396] [2021-06-05 09:05:56,560 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 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 09:05:56,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 09:05:56,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:05:56,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 60 conjunts are in the unsatisfiable core [2021-06-05 09:05:56,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:05:56,644 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 09:05:56,645 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:56,649 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:56,650 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:05:56,650 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:05:56,682 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 09:05:56,682 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 09:05:56,684 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:56,688 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:56,689 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:05:56,689 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 09:05:56,822 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 13 treesize of output 9 [2021-06-05 09:05:56,823 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:56,833 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:56,834 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:05:56,834 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2021-06-05 09:05:56,889 INFO L354 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2021-06-05 09:05:56,889 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 25 treesize of output 24 [2021-06-05 09:05:56,890 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:56,902 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:56,904 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 09:05:56,904 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:38 [2021-06-05 09:05:57,226 INFO L446 ElimStorePlain]: Different costs {4=[v_prenex_209], 9=[v_prenex_212, |v_#memory_int_252|]} [2021-06-05 09:05:57,265 INFO L354 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2021-06-05 09:05:57,265 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 2 case distinctions, treesize of input 43 treesize of output 33 [2021-06-05 09:05:57,266 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:57,325 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:57,346 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-06-05 09:05:57,346 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 09:05:57,347 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:57,380 INFO L354 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2021-06-05 09:05:57,380 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 3 case distinctions, treesize of input 32 treesize of output 42 [2021-06-05 09:05:57,381 INFO L550 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:57,441 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:57,484 INFO L354 Elim1Store]: treesize reduction 81, result has 28.9 percent of original size [2021-06-05 09:05:57,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 48 [2021-06-05 09:05:57,486 INFO L550 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:57,544 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:57,564 INFO L550 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2021-06-05 09:05:57,564 INFO L247 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:191, output treesize:142 [2021-06-05 09:05:59,000 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 59 DAG size of output: 25 [2021-06-05 09:05:59,226 INFO L354 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-06-05 09:05:59,226 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2021-06-05 09:05:59,227 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:59,232 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 09:05:59,233 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:59,254 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:59,258 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-06-05 09:05:59,258 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:23 [2021-06-05 09:05:59,295 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 09:05:59,296 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:59,302 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:59,303 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 09:05:59,304 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:05:59,307 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:05:59,308 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 09:05:59,308 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2021-06-05 09:05:59,335 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 09:05:59,335 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022389396] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:05:59,335 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:05:59,335 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 32 [2021-06-05 09:05:59,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354067156] [2021-06-05 09:05:59,336 INFO L462 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-06-05 09:05:59,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:05:59,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-06-05 09:05:59,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2021-06-05 09:05:59,336 INFO L87 Difference]: Start difference. First operand 184264 states and 557607 transitions. Second operand has 32 states, 32 states have (on average 4.03125) internal successors, (129), 32 states have internal predecessors, (129), 0 states have call successors, (0), 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 09:06:02,040 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-06-05 09:06:05,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 09:06:05,357 INFO L93 Difference]: Finished difference Result 250519 states and 751683 transitions. [2021-06-05 09:06:05,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2021-06-05 09:06:05,357 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 4.03125) internal successors, (129), 32 states have internal predecessors, (129), 0 states have call successors, (0), 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 77 [2021-06-05 09:06:05,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 09:06:05,862 INFO L225 Difference]: With dead ends: 250519 [2021-06-05 09:06:05,862 INFO L226 Difference]: Without dead ends: 250327 [2021-06-05 09:06:05,862 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1928 ImplicationChecksByTransitivity, 4142.7ms TimeCoverageRelationStatistics Valid=573, Invalid=5279, Unknown=0, NotChecked=0, Total=5852 [2021-06-05 09:06:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250327 states. [2021-06-05 09:06:09,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250327 to 184124. [2021-06-05 09:06:09,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184124 states, 184121 states have (on average 3.027481927645407) internal successors, (557423), 184123 states have internal predecessors, (557423), 0 states have call successors, (0), 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 09:06:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184124 states to 184124 states and 557423 transitions. [2021-06-05 09:06:10,588 INFO L78 Accepts]: Start accepts. Automaton has 184124 states and 557423 transitions. Word has length 77 [2021-06-05 09:06:10,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 09:06:10,588 INFO L482 AbstractCegarLoop]: Abstraction has 184124 states and 557423 transitions. [2021-06-05 09:06:10,588 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 32 states, 32 states have (on average 4.03125) internal successors, (129), 32 states have internal predecessors, (129), 0 states have call successors, (0), 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 09:06:10,604 INFO L276 IsEmpty]: Start isEmpty. Operand 184124 states and 557423 transitions. [2021-06-05 09:06:10,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 09:06:10,814 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 09:06:10,814 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-06-05 09:06:11,024 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1005 [2021-06-05 09:06:11,025 INFO L430 AbstractCegarLoop]: === Iteration 74 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 09:06:11,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 09:06:11,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1710070977, now seen corresponding path program 22 times [2021-06-05 09:06:11,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 09:06:11,025 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796508765] [2021-06-05 09:06:11,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 09:06:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 09:06:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 09:06:11,661 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 09:06:11,661 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796508765] [2021-06-05 09:06:11,661 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796508765] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:06:11,661 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723241254] [2021-06-05 09:06:11,661 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 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 09:06:11,739 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 09:06:11,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 09:06:11,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 67 conjunts are in the unsatisfiable core [2021-06-05 09:06:11,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 09:06:11,755 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 09:06:11,755 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:06:11,760 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:06:11,760 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:06:11,761 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 09:06:11,783 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-06-05 09:06:11,783 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 09:06:11,785 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:06:11,792 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:06:11,793 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:06:11,793 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2021-06-05 09:06:11,879 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-06-05 09:06:11,879 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 09:06:11,881 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:06:11,893 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:06:11,894 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:06:11,894 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:37 [2021-06-05 09:06:11,965 INFO L354 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2021-06-05 09:06:11,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2021-06-05 09:06:11,967 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:06:11,989 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:06:11,989 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:06:11,990 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:57 [2021-06-05 09:06:12,061 INFO L354 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2021-06-05 09:06:12,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2021-06-05 09:06:12,064 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:06:12,085 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:06:12,086 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:06:12,086 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:53 [2021-06-05 09:06:12,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 09:06:12,143 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:06:12,169 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:06:12,170 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:06:12,170 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:62 [2021-06-05 09:06:12,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 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 09:06:12,259 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:06:12,282 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:06:12,284 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 09:06:12,284 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2021-06-05 09:06:12,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 9 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 09:06:12,475 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:06:12,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 35 [2021-06-05 09:06:12,483 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:06:12,614 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2021-06-05 09:06:12,614 INFO L628 ElimStorePlain]: treesize reduction 4, result has 97.2 percent of original size [2021-06-05 09:06:12,623 INFO L550 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2021-06-05 09:06:12,623 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:169, output treesize:140 [2021-06-05 09:06:12,836 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-06-05 09:06:12,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 38 [2021-06-05 09:06:12,837 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:06:12,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2021-06-05 09:06:12,846 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 09:06:12,906 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:06:12,915 INFO L550 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2021-06-05 09:06:12,915 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:162, output treesize:108 [2021-06-05 09:06:13,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2021-06-05 09:06:13,526 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 09:06:13,536 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 09:06:13,537 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 09:06:13,538 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:60, output treesize:3 [2021-06-05 09:06:13,573 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-06-05 09:06:13,573 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723241254] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 09:06:13,573 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 09:06:13,573 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 33 [2021-06-05 09:06:13,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611131539] [2021-06-05 09:06:13,573 INFO L462 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-06-05 09:06:13,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 09:06:13,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-06-05 09:06:13,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=950, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 09:06:13,574 INFO L87 Difference]: Start difference. First operand 184124 states and 557423 transitions. Second operand has 33 states, 33 states have (on average 3.787878787878788) internal successors, (125), 33 states have internal predecessors, (125), 0 states have call successors, (0), 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 09:06:16,273 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 64 [2021-06-05 09:06:16,598 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 60 [2021-06-05 09:06:16,915 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2021-06-05 09:06:17,326 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2021-06-05 09:06:20,049 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2021-06-05 09:06:22,672 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 64 [2021-06-05 09:06:23,068 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2021-06-05 09:06:27,403 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 62 [2021-06-05 09:06:32,622 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 66 [2021-06-05 09:06:32,994 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 60 [2021-06-05 09:06:39,993 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 95 [2021-06-05 09:06:40,526 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 64 Received shutdown request... [2021-06-05 09:06:42,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2021-06-05 09:06:42,742 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1040 [2021-06-05 09:06:42,743 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 09:06:42,743 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT (1/2) [2021-06-05 09:06:42,744 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 09:06:42,744 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 09:06:42,744 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 09:06:42,744 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 09:06:42,744 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 09:06:42,744 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 09:06:42,744 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 09:06:42,744 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 09:06:42,744 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 09:06:42,746 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 137 places, 149 transitions, 310 flow [2021-06-05 09:06:42,746 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 09:06:42,746 INFO L315 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2021-06-05 09:06:42,746 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2021-06-05 09:06:42,747 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 09:06:42,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 09:06:42 BasicIcfg [2021-06-05 09:06:42,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 09:06:42,748 INFO L168 Benchmark]: Toolchain (without parser) took 765674.67 ms. Allocated memory was 360.7 MB in the beginning and 16.0 GB in the end (delta: 15.6 GB). Free memory was 323.3 MB in the beginning and 12.1 GB in the end (delta: -11.8 GB). Peak memory consumption was 3.9 GB. Max. memory is 16.0 GB. [2021-06-05 09:06:42,748 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 360.7 MB. Free memory is still 341.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 09:06:42,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.38 ms. Allocated memory is still 360.7 MB. Free memory was 323.0 MB in the beginning and 324.2 MB in the end (delta: -1.2 MB). Peak memory consumption was 4.7 MB. Max. memory is 16.0 GB. [2021-06-05 09:06:42,748 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.54 ms. Allocated memory is still 360.7 MB. Free memory was 324.2 MB in the beginning and 322.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 09:06:42,748 INFO L168 Benchmark]: Boogie Preprocessor took 14.96 ms. Allocated memory is still 360.7 MB. Free memory was 322.1 MB in the beginning and 320.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 09:06:42,748 INFO L168 Benchmark]: RCFGBuilder took 553.19 ms. Allocated memory is still 360.7 MB. Free memory was 320.0 MB in the beginning and 278.1 MB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.0 GB. [2021-06-05 09:06:42,748 INFO L168 Benchmark]: TraceAbstraction took 764765.66 ms. Allocated memory was 360.7 MB in the beginning and 16.0 GB in the end (delta: 15.6 GB). Free memory was 278.1 MB in the beginning and 12.1 GB in the end (delta: -11.8 GB). Peak memory consumption was 3.8 GB. Max. memory is 16.0 GB. [2021-06-05 09:06:42,749 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 360.7 MB. Free memory is still 341.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 309.38 ms. Allocated memory is still 360.7 MB. Free memory was 323.0 MB in the beginning and 324.2 MB in the end (delta: -1.2 MB). Peak memory consumption was 4.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 25.54 ms. Allocated memory is still 360.7 MB. Free memory was 324.2 MB in the beginning and 322.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 14.96 ms. Allocated memory is still 360.7 MB. Free memory was 322.1 MB in the beginning and 320.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 553.19 ms. Allocated memory is still 360.7 MB. Free memory was 320.0 MB in the beginning and 278.1 MB in the end (delta: 41.9 MB). Peak memory consumption was 41.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 764765.66 ms. Allocated memory was 360.7 MB in the beginning and 16.0 GB in the end (delta: 15.6 GB). Free memory was 278.1 MB in the beginning and 12.1 GB in the end (delta: -11.8 GB). Peak memory consumption was 3.8 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 725]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing difference of abstraction (184124states) and FLOYD_HOARE automaton (currently 60 states, 33 states before enhancement),while ReachableStatesComputation was computing reachable states (103820 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 731]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 137 places, 149 transitions, 310 flow. Already constructed 2 states. Currently 1 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 133 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 29490.3ms, OverallIterations: 12, TraceHistogramMax: 3, EmptinessCheckTime: 30.3ms, AutomataDifference: 17725.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 31.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1635 SDtfs, 6014 SDslu, 18538 SDs, 0 SdLazy, 8072 SolverSat, 590 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 5491.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1214 GetRequests, 615 SyntacticMatches, 5 SemanticMatches, 594 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15225 ImplicationChecksByTransitivity, 15158.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=963occurred in iteration=10, InterpolantAutomatonStates: 463, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 209.0ms AutomataMinimizationTime, 12 MinimizatonAttempts, 3500 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 164.2ms SsaConstructionTime, 453.4ms SatisfiabilityAnalysisTime, 8692.9ms InterpolantComputationTime, 1681 NumberOfCodeBlocks, 1672 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1661 ConstructedInterpolants, 66 QuantifiedInterpolants, 18336 SizeOfPredicates, 263 NumberOfNonLiveVariables, 1888 ConjunctsInSsa, 508 ConjunctsInUnsatCore, 20 InterpolantComputations, 4 PerfectInterpolantSequences, 265/620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 186 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 735062.2ms, OverallIterations: 74, TraceHistogramMax: 3, EmptinessCheckTime: 9280.5ms, AutomataDifference: 401650.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2291.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 34716 SDtfs, 81997 SDslu, 432704 SDs, 0 SdLazy, 165043 SolverSat, 4138 SolverUnsat, 84 SolverUnknown, 0 SolverNotchecked, 191491.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6503 GetRequests, 2840 SyntacticMatches, 117 SemanticMatches, 3546 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71064 ImplicationChecksByTransitivity, 223155.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=184264occurred in iteration=72, InterpolantAutomatonStates: 2792, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 180183.1ms AutomataMinimizationTime, 73 MinimizatonAttempts, 2728882 StatesRemovedByMinimization, 72 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1071.3ms SsaConstructionTime, 1279.0ms SatisfiabilityAnalysisTime, 127696.9ms InterpolantComputationTime, 8640 NumberOfCodeBlocks, 8267 NumberOfCodeBlocksAsserted, 136 NumberOfCheckSat, 8521 ConstructedInterpolants, 408 QuantifiedInterpolants, 129412 SizeOfPredicates, 1401 NumberOfNonLiveVariables, 8540 ConjunctsInSsa, 2591 ConjunctsInUnsatCore, 119 InterpolantComputations, 35 PerfectInterpolantSequences, 997/1221 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 133 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 34.4ms, OverallIterations: 1, TraceHistogramMax: 2, EmptinessCheckTime: 1.3ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=713occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5ms SsaConstructionTime, 3.4ms SatisfiabilityAnalysisTime, 0.0ms InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 4 procedures, 186 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 1.7ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown