/usr/bin/java -Xmx8000000000 -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-POR-NewStatesSleepPersistentFixedOrder-NoLbe-varabs.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_safe-6.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-11 07:30:08,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-11 07:30:08,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-11 07:30:09,013 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-11 07:30:09,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-11 07:30:09,014 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-11 07:30:09,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-11 07:30:09,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-11 07:30:09,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-11 07:30:09,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-11 07:30:09,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-11 07:30:09,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-11 07:30:09,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-11 07:30:09,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-11 07:30:09,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-11 07:30:09,021 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-11 07:30:09,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-11 07:30:09,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-11 07:30:09,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-11 07:30:09,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-11 07:30:09,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-11 07:30:09,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-11 07:30:09,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-11 07:30:09,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-11 07:30:09,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-11 07:30:09,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-11 07:30:09,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-11 07:30:09,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-11 07:30:09,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-11 07:30:09,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-11 07:30:09,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-11 07:30:09,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-11 07:30:09,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-11 07:30:09,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-11 07:30:09,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-11 07:30:09,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-11 07:30:09,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-11 07:30:09,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-11 07:30:09,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-11 07:30:09,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-11 07:30:09,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-11 07:30:09,037 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-POR-NewStatesSleepPersistentFixedOrder-NoLbe-varabs.epf [2022-02-11 07:30:09,050 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-11 07:30:09,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-11 07:30:09,051 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-11 07:30:09,051 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-11 07:30:09,052 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-11 07:30:09,052 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-11 07:30:09,052 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-11 07:30:09,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-11 07:30:09,053 INFO L138 SettingsManager]: * Use SBE=true [2022-02-11 07:30:09,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-11 07:30:09,053 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-11 07:30:09,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-11 07:30:09,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-11 07:30:09,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-11 07:30:09,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-11 07:30:09,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-11 07:30:09,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-11 07:30:09,054 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-11 07:30:09,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-11 07:30:09,054 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-11 07:30:09,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-11 07:30:09,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-11 07:30:09,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-11 07:30:09,054 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-11 07:30:09,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-11 07:30:09,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-11 07:30:09,055 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-11 07:30:09,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-11 07:30:09,055 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-11 07:30:09,055 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-11 07:30:09,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-11 07:30:09,055 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-11 07:30:09,055 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-02-11 07:30:09,055 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-11 07:30:09,056 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-11 07:30:09,056 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-02-11 07:30:09,056 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-02-11 07:30:09,056 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 [2022-02-11 07:30:09,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-11 07:30:09,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-11 07:30:09,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-11 07:30:09,236 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-11 07:30:09,246 INFO L275 PluginConnector]: CDTParser initialized [2022-02-11 07:30:09,247 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_safe-6.i [2022-02-11 07:30:09,293 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/462afde6d/97d2e47b64a748e29382759a4b6cd4d0/FLAG118baf3a7 [2022-02-11 07:30:09,691 INFO L306 CDTParser]: Found 1 translation units. [2022-02-11 07:30:09,691 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-6.i [2022-02-11 07:30:09,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/462afde6d/97d2e47b64a748e29382759a4b6cd4d0/FLAG118baf3a7 [2022-02-11 07:30:10,054 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/462afde6d/97d2e47b64a748e29382759a4b6cd4d0 [2022-02-11 07:30:10,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-11 07:30:10,057 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-11 07:30:10,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-11 07:30:10,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-11 07:30:10,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-11 07:30:10,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.02 07:30:10" (1/1) ... [2022-02-11 07:30:10,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@238a64d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 07:30:10, skipping insertion in model container [2022-02-11 07:30:10,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.02 07:30:10" (1/1) ... [2022-02-11 07:30:10,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-11 07:30:10,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-11 07:30:10,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-6.i[30813,30826] [2022-02-11 07:30:10,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-11 07:30:10,546 INFO L203 MainTranslator]: Completed pre-run [2022-02-11 07:30:10,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-6.i[30813,30826] [2022-02-11 07:30:10,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-11 07:30:10,658 INFO L208 MainTranslator]: Completed translation [2022-02-11 07:30:10,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 07:30:10 WrapperNode [2022-02-11 07:30:10,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-11 07:30:10,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-11 07:30:10,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-11 07:30:10,659 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-11 07:30:10,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 07:30:10" (1/1) ... [2022-02-11 07:30:10,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 07:30:10" (1/1) ... [2022-02-11 07:30:10,738 INFO L137 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2022-02-11 07:30:10,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-11 07:30:10,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-11 07:30:10,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-11 07:30:10,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-11 07:30:10,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 07:30:10" (1/1) ... [2022-02-11 07:30:10,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 07:30:10" (1/1) ... [2022-02-11 07:30:10,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 07:30:10" (1/1) ... [2022-02-11 07:30:10,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 07:30:10" (1/1) ... [2022-02-11 07:30:10,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 07:30:10" (1/1) ... [2022-02-11 07:30:10,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 07:30:10" (1/1) ... [2022-02-11 07:30:10,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 07:30:10" (1/1) ... [2022-02-11 07:30:10,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-11 07:30:10,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-11 07:30:10,780 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-11 07:30:10,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-11 07:30:10,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 07:30:10" (1/1) ... [2022-02-11 07:30:10,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-11 07:30:10,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 07:30:10,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-11 07:30:10,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-11 07:30:10,879 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-02-11 07:30:10,880 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-02-11 07:30:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-02-11 07:30:10,880 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-02-11 07:30:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-11 07:30:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-11 07:30:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-11 07:30:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-11 07:30:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-11 07:30:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-11 07:30:10,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-11 07:30:10,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-11 07:30:10,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-11 07:30:10,882 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-11 07:30:10,953 INFO L234 CfgBuilder]: Building ICFG [2022-02-11 07:30:10,954 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-11 07:30:11,156 INFO L275 CfgBuilder]: Performing block encoding [2022-02-11 07:30:11,161 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-11 07:30:11,161 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-11 07:30:11,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.02 07:30:11 BoogieIcfgContainer [2022-02-11 07:30:11,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-11 07:30:11,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-11 07:30:11,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-11 07:30:11,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-11 07:30:11,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.02 07:30:10" (1/3) ... [2022-02-11 07:30:11,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48af8b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.02 07:30:11, skipping insertion in model container [2022-02-11 07:30:11,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.02 07:30:10" (2/3) ... [2022-02-11 07:30:11,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48af8b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.02 07:30:11, skipping insertion in model container [2022-02-11 07:30:11,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.02 07:30:11" (3/3) ... [2022-02-11 07:30:11,182 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_safe-6.i [2022-02-11 07:30:11,185 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-11 07:30:11,186 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-11 07:30:11,186 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-11 07:30:11,186 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-11 07:30:11,259 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,260 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,260 WARN L322 ript$VariableManager]: TermVariable t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,260 WARN L322 ript$VariableManager]: TermVariable t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,260 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,260 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,260 WARN L322 ript$VariableManager]: TermVariable t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,261 WARN L322 ript$VariableManager]: TermVariable t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,261 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,261 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,261 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,262 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,262 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,262 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,262 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,262 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,262 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,263 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,263 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,263 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,263 WARN L322 ript$VariableManager]: TermVariable t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,263 WARN L322 ript$VariableManager]: TermVariable t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,263 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,263 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,264 WARN L322 ript$VariableManager]: TermVariable t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,264 WARN L322 ript$VariableManager]: TermVariable t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,264 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,264 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,264 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,264 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,265 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,265 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,265 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,265 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,265 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,266 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,268 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,268 WARN L322 ript$VariableManager]: TermVariable t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,268 WARN L322 ript$VariableManager]: TermVariable t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,268 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,268 WARN L322 ript$VariableManager]: TermVariable |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,270 WARN L322 ript$VariableManager]: TermVariable t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,270 WARN L322 ript$VariableManager]: TermVariable t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,270 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,270 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,270 WARN L322 ript$VariableManager]: TermVariable |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 07:30:11,271 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-11 07:30:11,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-11 07:30:11,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 07:30:11,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-11 07:30:11,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-02-11 07:30:11,410 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-02-11 07:30:11,414 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-11 07:30:11,414 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-11 07:30:11,569 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-11 07:30:11,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 07:30:11,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1927097680, now seen corresponding path program 1 times [2022-02-11 07:30:11,578 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 07:30:11,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127230096] [2022-02-11 07:30:11,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 07:30:11,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 07:30:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 07:30:11,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 07:30:11,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 07:30:11,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127230096] [2022-02-11 07:30:11,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127230096] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 07:30:11,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 07:30:11,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-11 07:30:11,774 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276727428] [2022-02-11 07:30:11,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 07:30:11,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-11 07:30:11,777 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 07:30:11,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-11 07:30:11,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-11 07:30:11,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:30:11,807 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 07:30:11,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 07:30:11,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:30:11,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:30:11,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: ResultService,SelfDestructingSolverStorable0 [2022-02-11 07:30:11,840 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-11 07:30:11,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 07:30:11,842 INFO L85 PathProgramCache]: Analyzing trace with hash 560415153, now seen corresponding path program 1 times [2022-02-11 07:30:11,842 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 07:30:11,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393008195] [2022-02-11 07:30:11,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 07:30:11,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 07:30:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 07:30:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 07:30:11,913 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 07:30:11,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393008195] [2022-02-11 07:30:11,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393008195] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 07:30:11,913 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 07:30:11,913 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-11 07:30:11,913 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910612693] [2022-02-11 07:30:11,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 07:30:11,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 07:30:11,914 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 07:30:11,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 07:30:11,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-11 07:30:11,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:30:11,916 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 07:30:11,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 07:30:11,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:30:11,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:30:11,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:30:11,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 07:30:11,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,ResultService [2022-02-11 07:30:11,989 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-11 07:30:11,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 07:30:11,989 INFO L85 PathProgramCache]: Analyzing trace with hash -951035470, now seen corresponding path program 1 times [2022-02-11 07:30:11,989 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 07:30:11,989 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615091129] [2022-02-11 07:30:11,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 07:30:11,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 07:30:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 07:30:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 07:30:12,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 07:30:12,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615091129] [2022-02-11 07:30:12,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615091129] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 07:30:12,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447596568] [2022-02-11 07:30:12,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 07:30:12,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 07:30:12,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 07:30:12,084 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 07:30:12,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-11 07:30:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 07:30:12,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-11 07:30:12,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 07:30:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 07:30:12,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 07:30:12,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 07:30:12,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447596568] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 07:30:12,473 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 07:30:12,473 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-11 07:30:12,473 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644658141] [2022-02-11 07:30:12,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 07:30:12,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-11 07:30:12,474 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 07:30:12,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-11 07:30:12,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-11 07:30:12,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:30:12,476 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 07:30:12,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 07:30:12,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:30:12,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 07:30:12,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:30:12,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:30:12,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 07:30:12,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 07:30:12,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-11 07:30:12,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2,ResultService [2022-02-11 07:30:12,813 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-11 07:30:12,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 07:30:12,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1666707666, now seen corresponding path program 2 times [2022-02-11 07:30:12,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 07:30:12,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311890158] [2022-02-11 07:30:12,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 07:30:12,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 07:30:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 07:30:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 07:30:12,887 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 07:30:12,887 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311890158] [2022-02-11 07:30:12,887 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311890158] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 07:30:12,887 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785587136] [2022-02-11 07:30:12,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-11 07:30:12,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 07:30:12,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 07:30:12,910 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 07:30:12,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-11 07:30:12,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-11 07:30:12,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 07:30:12,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-11 07:30:12,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 07:30:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 07:30:13,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 07:30:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 07:30:13,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785587136] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 07:30:13,223 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 07:30:13,224 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-11 07:30:13,224 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486857217] [2022-02-11 07:30:13,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 07:30:13,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-11 07:30:13,224 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 07:30:13,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-11 07:30:13,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-11 07:30:13,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:30:13,226 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 07:30:13,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 07:30:13,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:30:13,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 07:30:13,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 07:30:13,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:30:13,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:30:13,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 07:30:13,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 07:30:13,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-11 07:30:13,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-11 07:30:13,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,ResultService,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 07:30:13,586 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-11 07:30:13,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 07:30:13,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1283180782, now seen corresponding path program 3 times [2022-02-11 07:30:13,587 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 07:30:13,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566865781] [2022-02-11 07:30:13,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 07:30:13,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 07:30:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 07:30:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 07:30:13,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 07:30:13,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566865781] [2022-02-11 07:30:13,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566865781] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 07:30:13,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529821194] [2022-02-11 07:30:13,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-11 07:30:13,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 07:30:13,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 07:30:13,722 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 07:30:13,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-11 07:30:13,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-02-11 07:30:13,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 07:30:13,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-11 07:30:13,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 07:30:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 07:30:13,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 07:30:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 07:30:14,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529821194] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 07:30:14,208 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 07:30:14,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 31 [2022-02-11 07:30:14,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071902953] [2022-02-11 07:30:14,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 07:30:14,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-02-11 07:30:14,208 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 07:30:14,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-02-11 07:30:14,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2022-02-11 07:30:14,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:30:14,210 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 07:30:14,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.935483870967742) internal successors, (153), 31 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) [2022-02-11 07:30:14,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:30:14,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 07:30:14,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 07:30:14,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-11 07:30:14,211 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:30:14,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:30:14,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 07:30:14,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 07:30:14,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-11 07:30:14,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-11 07:30:14,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-11 07:30:14,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,ResultService,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 07:30:14,719 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-11 07:30:14,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 07:30:14,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2049692625, now seen corresponding path program 4 times [2022-02-11 07:30:14,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 07:30:14,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968584915] [2022-02-11 07:30:14,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 07:30:14,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 07:30:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 07:30:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 07:30:15,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 07:30:15,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968584915] [2022-02-11 07:30:15,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968584915] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 07:30:15,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867163949] [2022-02-11 07:30:15,787 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-11 07:30:15,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 07:30:15,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 07:30:15,788 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 07:30:15,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-11 07:30:15,868 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-11 07:30:15,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 07:30:15,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 47 conjunts are in the unsatisfiable core [2022-02-11 07:30:15,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 07:30:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 486 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 07:30:19,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 07:39:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 649 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 07:39:38,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867163949] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 07:39:38,423 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 07:39:38,423 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 139 [2022-02-11 07:39:38,423 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252493170] [2022-02-11 07:39:38,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 07:39:38,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2022-02-11 07:39:38,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 07:39:38,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2022-02-11 07:39:38,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1240, Invalid=17784, Unknown=158, NotChecked=0, Total=19182 [2022-02-11 07:39:38,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:39:38,430 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 07:39:38,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 139 states have (on average 3.050359712230216) internal successors, (424), 139 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 07:39:38,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:39:38,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 07:39:38,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 07:39:38,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-11 07:39:38,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-02-11 07:39:38,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:39:41,069 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (* (- 1) c_~j~0)) (.cse1 (+ c_~prev~0 c_~next~0)) (.cse2 (* (- 1) c_~i~0)) (.cse7 (+ 2 c_~prev~0 c_~next~0))) (and (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse0 (* 2 v_~cur~0_32))) (or (< aux_div_v_~cur~0_28_51 (+ .cse0 c_~next~0 1)) (< v_~prev~0_30 (+ c_~next~0 v_~cur~0_32)) (> 0 aux_mod_v_~cur~0_28_51) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~j~0 10) (+ .cse0 c_~next~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4))) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~j~0))) (< v_~cur~0_32 (+ c_~prev~0 c_~next~0)) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2)))) (<= c_~i~0 .cse1) (forall ((v_~cur~0_28 Int)) (or (and (forall ((aux_div_v_~next~0_24_56 Int) (aux_mod_v_~next~0_24_56 Int)) (or (not (<= (+ c_~prev~0 (* 2 v_~cur~0_28) (* 2 aux_div_v_~next~0_24_56)) (+ aux_mod_v_~next~0_24_56 c_~i~0 8))) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2) (<= (+ (* 5 aux_div_v_~next~0_24_56) v_~cur~0_28) (+ (* aux_mod_v_~next~0_24_56 2) 20 (* 2 c_~i~0))))) (forall ((aux_div_v_~next~0_24_56 Int) (aux_mod_v_~next~0_24_56 Int)) (or (not (<= (+ c_~prev~0 (* 2 v_~cur~0_28) (* 2 aux_div_v_~next~0_24_56)) (+ aux_mod_v_~next~0_24_56 c_~j~0 8))) (<= (+ (* 5 aux_div_v_~next~0_24_56) v_~cur~0_28) (+ (* aux_mod_v_~next~0_24_56 2) 20 (* 2 c_~j~0))) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2)))) (not (<= c_~next~0 v_~cur~0_28)))) (<= (div (+ c_~prev~0 .cse2) (- 2)) c_~next~0) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int) (v_~cur~0_34 Int)) (let ((.cse3 (* 2 v_~cur~0_32))) (or (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~i~0 10) (+ .cse3 c_~next~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) v_~cur~0_34)) (< v_~cur~0_32 (+ c_~next~0 (* 2 v_~cur~0_34))) (< aux_div_v_~cur~0_28_51 (+ .cse3 c_~next~0 v_~cur~0_34 1)) (> 0 aux_mod_v_~cur~0_28_51) (< v_~prev~0_30 (+ c_~next~0 v_~cur~0_34 v_~cur~0_32)) (> 0 aux_mod_v_~next~0_24_56) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~i~0))) (< v_~cur~0_34 (+ c_~prev~0 c_~next~0)) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2)))) (forall ((v_~cur~0_28 Int) (aux_div_v_~next~0_24_56 Int) (aux_mod_v_~next~0_24_56 Int)) (or (< (+ aux_mod_v_~next~0_24_56 c_~j~0 8) (+ (* 2 v_~cur~0_28) c_~next~0 (* 2 aux_div_v_~next~0_24_56))) (< v_~cur~0_28 (+ c_~prev~0 c_~next~0)) (<= (+ (* 5 aux_div_v_~next~0_24_56) v_~cur~0_28) (+ (* aux_mod_v_~next~0_24_56 2) 20 (* 2 c_~j~0))) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2))) (forall ((v_~cur~0_32 Int)) (or (not (<= c_~next~0 v_~cur~0_32)) (and (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse4 (* 2 v_~cur~0_32))) (or (< v_~prev~0_30 (+ c_~prev~0 v_~cur~0_32)) (> 0 aux_mod_v_~cur~0_28_51) (> 0 aux_mod_v_~next~0_24_56) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~i~0))) (< aux_div_v_~cur~0_28_51 (+ .cse4 c_~prev~0 1)) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~i~0 10) (+ .cse4 c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4)))))) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse5 (* 2 v_~cur~0_32))) (or (< v_~prev~0_30 (+ c_~prev~0 v_~cur~0_32)) (> 0 aux_mod_v_~cur~0_28_51) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~j~0 10) (+ .cse5 c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4))) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~j~0))) (> 0 aux_mod_v_~next~0_24_56) (< aux_div_v_~cur~0_28_51 (+ .cse5 c_~prev~0 1)) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2))))))) (<= (div (+ .cse6 (- 4) c_~next~0) (- 2)) .cse7) (forall ((v_~cur~0_34 Int)) (or (and (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse8 (* 2 v_~cur~0_32))) (or (> 0 aux_mod_v_~cur~0_28_51) (< aux_div_v_~cur~0_28_51 (+ .cse8 c_~prev~0 v_~cur~0_34 1)) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~j~0 10) (+ .cse8 c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) v_~cur~0_34)) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~j~0))) (> 0 aux_mod_v_~next~0_24_56) (< v_~prev~0_30 (+ c_~prev~0 v_~cur~0_34 v_~cur~0_32)) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2) (< v_~cur~0_32 (+ c_~prev~0 (* 2 v_~cur~0_34)))))) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse9 (* 2 v_~cur~0_32))) (or (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~i~0 10) (+ .cse9 c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) v_~cur~0_34)) (> 0 aux_mod_v_~cur~0_28_51) (< aux_div_v_~cur~0_28_51 (+ .cse9 c_~prev~0 v_~cur~0_34 1)) (> 0 aux_mod_v_~next~0_24_56) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~i~0))) (< v_~prev~0_30 (+ c_~prev~0 v_~cur~0_34 v_~cur~0_32)) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2) (< v_~cur~0_32 (+ c_~prev~0 (* 2 v_~cur~0_34))))))) (not (<= c_~next~0 v_~cur~0_34)))) (= c_~prev~0 0) (= c_~j~0 1) (<= (div (+ c_~prev~0 .cse6) (- 2)) c_~next~0) (forall ((aux_div_v_~cur~0_27_56 Int) (aux_mod_v_~cur~0_27_56 Int)) (or (> 0 aux_mod_v_~cur~0_27_56) (not (<= (+ (* 2 aux_div_v_~cur~0_27_56) c_~prev~0 c_~next~0) (+ 6 c_~i~0 aux_mod_v_~cur~0_27_56))) (>= aux_mod_v_~cur~0_27_56 2) (<= (+ c_~prev~0 (* 5 aux_div_v_~cur~0_27_56)) (+ (* 2 aux_mod_v_~cur~0_27_56) 15 (* 2 c_~i~0))))) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse10 (* 2 v_~cur~0_32))) (or (< aux_div_v_~cur~0_28_51 (+ .cse10 c_~next~0 1)) (< v_~prev~0_30 (+ c_~next~0 v_~cur~0_32)) (> 0 aux_mod_v_~cur~0_28_51) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~i~0 10) (+ .cse10 c_~next~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4))) (< v_~cur~0_32 (+ c_~prev~0 c_~next~0)) (> 0 aux_mod_v_~next~0_24_56) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~i~0))) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2)))) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (aux_mod_v_~next~0_24_56 Int)) (or (<= (+ c_~prev~0 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~j~0))) (> 0 aux_mod_v_~cur~0_28_51) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~j~0 10) (+ (* 3 c_~prev~0) c_~next~0 (* 2 aux_div_v_~next~0_24_56) (* aux_div_v_~cur~0_28_51 4))) (> 0 aux_mod_v_~next~0_24_56) (< aux_div_v_~cur~0_28_51 (+ c_~next~0 1)) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2))) (= 1 c_~cur~0) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (aux_mod_v_~next~0_24_56 Int)) (or (< v_~prev~0_30 c_~next~0) (< aux_div_v_~cur~0_28_51 (+ c_~prev~0 c_~next~0 1)) (> 0 aux_mod_v_~cur~0_28_51) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~j~0 10) (+ c_~prev~0 c_~next~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4))) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~j~0))) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2))) (<= c_~j~0 .cse1) (forall ((v_~cur~0_28 Int) (aux_div_v_~next~0_24_56 Int) (aux_mod_v_~next~0_24_56 Int)) (or (< (+ aux_mod_v_~next~0_24_56 c_~i~0 8) (+ (* 2 v_~cur~0_28) c_~next~0 (* 2 aux_div_v_~next~0_24_56))) (< v_~cur~0_28 (+ c_~prev~0 c_~next~0)) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2) (<= (+ (* 5 aux_div_v_~next~0_24_56) v_~cur~0_28) (+ (* aux_mod_v_~next~0_24_56 2) 20 (* 2 c_~i~0))))) (forall ((aux_div_v_~cur~0_27_56 Int) (aux_mod_v_~cur~0_27_56 Int)) (or (<= (+ c_~prev~0 (* 5 aux_div_v_~cur~0_27_56)) (+ (* 2 aux_mod_v_~cur~0_27_56) 15 (* 2 c_~j~0))) (> 0 aux_mod_v_~cur~0_27_56) (>= aux_mod_v_~cur~0_27_56 2) (not (<= (+ (* 2 aux_div_v_~cur~0_27_56) c_~prev~0 c_~next~0) (+ c_~j~0 6 aux_mod_v_~cur~0_27_56))))) (= c_~i~0 1) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int) (v_~cur~0_34 Int)) (let ((.cse11 (* 2 v_~cur~0_32))) (or (< v_~cur~0_32 (+ c_~next~0 (* 2 v_~cur~0_34))) (< aux_div_v_~cur~0_28_51 (+ .cse11 c_~next~0 v_~cur~0_34 1)) (> 0 aux_mod_v_~cur~0_28_51) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~j~0 10) (+ .cse11 c_~next~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) v_~cur~0_34)) (< v_~prev~0_30 (+ c_~next~0 v_~cur~0_34 v_~cur~0_32)) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~j~0))) (> 0 aux_mod_v_~next~0_24_56) (< v_~cur~0_34 (+ c_~prev~0 c_~next~0)) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2)))) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (aux_mod_v_~next~0_24_56 Int)) (or (< v_~prev~0_30 c_~next~0) (< aux_div_v_~cur~0_28_51 (+ c_~prev~0 c_~next~0 1)) (> 0 aux_mod_v_~cur~0_28_51) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~i~0 10) (+ c_~prev~0 c_~next~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4))) (> 0 aux_mod_v_~next~0_24_56) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~i~0))) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2))) (<= c_~cur~0 c_~next~0) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (aux_mod_v_~next~0_24_56 Int)) (or (> 0 aux_mod_v_~cur~0_28_51) (<= (+ c_~prev~0 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~i~0))) (> 0 aux_mod_v_~next~0_24_56) (< aux_div_v_~cur~0_28_51 (+ c_~next~0 1)) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~i~0 10) (+ (* 3 c_~prev~0) c_~next~0 (* 2 aux_div_v_~next~0_24_56) (* aux_div_v_~cur~0_28_51 4))))) (<= (div (+ .cse2 (- 4) c_~next~0) (- 2)) .cse7))) is different from false [2022-02-11 07:42:47,893 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse20 (* (- 1) c_~j~0)) (.cse14 (* (- 1) c_~i~0)) (.cse23 (* 2 c_~cur~0))) (let ((.cse0 (+ c_~prev~0 c_~cur~0)) (.cse4 (+ .cse23 c_~prev~0)) (.cse9 (div (+ (- 2) .cse14 c_~cur~0) (- 2))) (.cse7 (+ c_~next~0 1)) (.cse3 (+ c_~prev~0 c_~next~0)) (.cse6 (div (+ (- 2) .cse20 c_~cur~0) (- 2))) (.cse10 (+ c_~prev~0 1 c_~cur~0)) (.cse19 (+ (* 2 c_~next~0) 4 c_~cur~0)) (.cse15 (+ .cse23 3 c_~prev~0)) (.cse18 (+ 2 c_~next~0 c_~cur~0)) (.cse16 (+ c_~next~0 c_~cur~0))) (and (forall ((v_~cur~0_28 Int) (aux_div_v_~next~0_24_56 Int) (aux_mod_v_~next~0_24_56 Int)) (or (< (+ aux_mod_v_~next~0_24_56 c_~j~0 8) (+ c_~prev~0 (* 2 v_~cur~0_28) (* 2 aux_div_v_~next~0_24_56) c_~cur~0)) (< v_~cur~0_28 (+ (* 2 c_~cur~0) c_~prev~0)) (<= (+ (* 5 aux_div_v_~next~0_24_56) v_~cur~0_28) (+ (* aux_mod_v_~next~0_24_56 2) 20 (* 2 c_~j~0))) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2))) (<= c_~i~0 .cse0) (forall ((v_~cur~0_34 Int)) (or (and (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse1 (* 2 v_~cur~0_32))) (or (< v_~prev~0_30 (+ v_~cur~0_34 v_~cur~0_32 c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (> 0 aux_mod_v_~next~0_24_56) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~i~0))) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~i~0 10) (+ .cse1 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) v_~cur~0_34 c_~cur~0)) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2) (< v_~cur~0_32 (+ (* 2 v_~cur~0_34) c_~cur~0)) (< aux_div_v_~cur~0_28_51 (+ .cse1 v_~cur~0_34 1 c_~cur~0))))) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse2 (* 2 v_~cur~0_32))) (or (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~j~0 10) (+ .cse2 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) v_~cur~0_34 c_~cur~0)) (< v_~prev~0_30 (+ v_~cur~0_34 v_~cur~0_32 c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~j~0))) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2) (< v_~cur~0_32 (+ (* 2 v_~cur~0_34) c_~cur~0)) (< aux_div_v_~cur~0_28_51 (+ .cse2 v_~cur~0_34 1 c_~cur~0)))))) (< v_~cur~0_34 (+ c_~prev~0 c_~cur~0)))) (<= c_~j~0 c_~next~0) (<= c_~i~0 .cse3) (<= c_~j~0 |c_ULTIMATE.start_main_~correct~0#1|) (<= c_~j~0 .cse4) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int) (v_~cur~0_34 Int)) (let ((.cse5 (* 2 v_~cur~0_32))) (or (< v_~cur~0_34 (+ (* 2 c_~cur~0) c_~prev~0)) (< v_~cur~0_32 (+ c_~prev~0 (* 2 v_~cur~0_34) c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~j~0 10) (+ .cse5 c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) v_~cur~0_34 c_~cur~0)) (< v_~prev~0_30 (+ c_~prev~0 v_~cur~0_34 v_~cur~0_32 c_~cur~0)) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~j~0))) (< aux_div_v_~cur~0_28_51 (+ .cse5 c_~prev~0 v_~cur~0_34 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2)))) (<= .cse6 .cse7) (forall ((aux_div_v_~next~0_24_56 Int) (aux_mod_v_~next~0_24_56 Int)) (or (not (<= (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~next~0_24_56)) (+ aux_mod_v_~next~0_24_56 c_~i~0 8))) (<= (+ (* 5 aux_div_v_~next~0_24_56) c_~cur~0) (+ (* aux_mod_v_~next~0_24_56 2) 20 (* 2 c_~i~0))) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2))) (forall ((v_~prev~0_30 Int)) (or (and (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (aux_mod_v_~next~0_24_56 Int)) (or (< aux_div_v_~cur~0_28_51 (+ c_~prev~0 1 c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (> 0 aux_mod_v_~next~0_24_56) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~i~0))) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~i~0 10) (+ c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) c_~cur~0)))) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (aux_mod_v_~next~0_24_56 Int)) (or (< aux_div_v_~cur~0_28_51 (+ c_~prev~0 1 c_~cur~0)) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~j~0 10) (+ c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~j~0))) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2)))) (not (<= c_~cur~0 v_~prev~0_30)))) (<= c_~i~0 c_~next~0) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int) (v_~cur~0_34 Int)) (let ((.cse8 (* 2 v_~cur~0_32))) (or (< v_~cur~0_34 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~i~0 10) (+ .cse8 c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) v_~cur~0_34 c_~cur~0)) (< v_~cur~0_32 (+ c_~prev~0 (* 2 v_~cur~0_34) c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (< v_~prev~0_30 (+ c_~prev~0 v_~cur~0_34 v_~cur~0_32 c_~cur~0)) (< aux_div_v_~cur~0_28_51 (+ .cse8 c_~prev~0 v_~cur~0_34 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_24_56) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~i~0))) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2)))) (<= .cse9 .cse10) (forall ((v_~cur~0_32 Int)) (or (and (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse11 (* 2 v_~cur~0_32))) (or (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~j~0 10) (+ .cse11 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~j~0))) (< aux_div_v_~cur~0_28_51 (+ .cse11 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2) (< v_~prev~0_30 (+ v_~cur~0_32 c_~cur~0))))) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse12 (* 2 v_~cur~0_32))) (or (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~i~0 10) (+ .cse12 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (< aux_div_v_~cur~0_28_51 (+ .cse12 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_24_56) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~i~0))) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2) (< v_~prev~0_30 (+ v_~cur~0_32 c_~cur~0)))))) (< v_~cur~0_32 (+ c_~prev~0 c_~cur~0)))) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse13 (* 2 v_~cur~0_32))) (or (< v_~prev~0_30 (+ c_~prev~0 v_~cur~0_32 c_~cur~0)) (< v_~cur~0_32 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~cur~0_28_51) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~j~0 10) (+ .cse13 c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) c_~cur~0)) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~j~0))) (> 0 aux_mod_v_~next~0_24_56) (< aux_div_v_~cur~0_28_51 (+ .cse13 c_~prev~0 1 c_~cur~0)) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2)))) (<= (div (+ c_~prev~0 .cse14 (- 6) c_~cur~0) (- 2)) .cse15) (<= c_~j~0 c_~cur~0) (forall ((v_~cur~0_28 Int) (aux_div_v_~next~0_24_56 Int) (aux_mod_v_~next~0_24_56 Int)) (or (< (+ aux_mod_v_~next~0_24_56 c_~i~0 8) (+ c_~prev~0 (* 2 v_~cur~0_28) (* 2 aux_div_v_~next~0_24_56) c_~cur~0)) (< v_~cur~0_28 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2) (<= (+ (* 5 aux_div_v_~next~0_24_56) v_~cur~0_28) (+ (* aux_mod_v_~next~0_24_56 2) 20 (* 2 c_~i~0))))) (forall ((v_~cur~0_28 Int)) (or (< v_~cur~0_28 (+ c_~prev~0 c_~cur~0)) (and (forall ((aux_div_v_~next~0_24_56 Int) (aux_mod_v_~next~0_24_56 Int)) (or (< (+ aux_mod_v_~next~0_24_56 c_~i~0 8) (+ (* 2 v_~cur~0_28) (* 2 aux_div_v_~next~0_24_56) c_~cur~0)) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2) (<= (+ (* 5 aux_div_v_~next~0_24_56) v_~cur~0_28) (+ (* aux_mod_v_~next~0_24_56 2) 20 (* 2 c_~i~0))))) (forall ((aux_div_v_~next~0_24_56 Int) (aux_mod_v_~next~0_24_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_24_56) v_~cur~0_28) (+ (* aux_mod_v_~next~0_24_56 2) 20 (* 2 c_~j~0))) (< (+ aux_mod_v_~next~0_24_56 c_~j~0 8) (+ (* 2 v_~cur~0_28) (* 2 aux_div_v_~next~0_24_56) c_~cur~0)) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2)))))) (<= c_~j~0 .cse16) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse17 (* 2 c_~cur~0))) (or (< aux_div_v_~cur~0_28_51 (+ .cse17 c_~prev~0 1)) (> 0 aux_mod_v_~cur~0_28_51) (< v_~prev~0_30 (+ c_~prev~0 c_~cur~0)) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~j~0 10) (+ .cse17 c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4))) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~j~0))) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2)))) (<= c_~j~0 .cse0) (<= c_~i~0 .cse4) (<= .cse9 .cse7) (forall ((aux_div_v_~next~0_24_56 Int) (aux_mod_v_~next~0_24_56 Int)) (or (not (<= (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~next~0_24_56)) (+ aux_mod_v_~next~0_24_56 c_~j~0 8))) (> 0 aux_mod_v_~next~0_24_56) (<= (+ (* 5 aux_div_v_~next~0_24_56) c_~cur~0) (+ (* aux_mod_v_~next~0_24_56 2) 20 (* 2 c_~j~0))) (>= aux_mod_v_~next~0_24_56 2))) (<= (div (+ .cse14 (- 4) c_~next~0) (- 2)) .cse18) (<= 0 c_~prev~0) (<= (div (+ .cse14 c_~next~0 (- 8) c_~cur~0) (- 2)) .cse19) (<= c_~j~0 .cse3) (<= c_~i~0 |c_ULTIMATE.start_main_~correct~0#1|) (<= .cse6 .cse10) (<= c_~j~0 |c_ULTIMATE.start_fib_#res#1|) (<= (div (+ .cse20 c_~next~0 (- 8) c_~cur~0) (- 2)) .cse19) (<= c_~i~0 c_~cur~0) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse21 (* 2 v_~cur~0_32))) (or (< v_~prev~0_30 (+ c_~prev~0 v_~cur~0_32 c_~cur~0)) (< v_~cur~0_32 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~i~0 10) (+ .cse21 c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (> 0 aux_mod_v_~next~0_24_56) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~i~0))) (< aux_div_v_~cur~0_28_51 (+ .cse21 c_~prev~0 1 c_~cur~0)) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2)))) (<= c_~i~0 |c_ULTIMATE.start_fib_#res#1|) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse22 (* 2 c_~cur~0))) (or (< aux_div_v_~cur~0_28_51 (+ .cse22 c_~prev~0 1)) (> 0 aux_mod_v_~cur~0_28_51) (< v_~prev~0_30 (+ c_~prev~0 c_~cur~0)) (> 0 aux_mod_v_~next~0_24_56) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~i~0))) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~i~0 10) (+ .cse22 c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4))) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2)))) (<= (div (+ c_~prev~0 .cse20 (- 6) c_~cur~0) (- 2)) .cse15) (<= (div (+ .cse20 (- 4) c_~next~0) (- 2)) .cse18) (<= c_~i~0 1) (<= c_~i~0 .cse16) (<= 1 c_~cur~0)))) is different from false [2022-02-11 07:42:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:42:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 07:42:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 07:42:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-11 07:42:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-11 07:42:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-02-11 07:42:48,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-11 07:42:48,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: ResultService,SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 07:42:48,196 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-11 07:42:48,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 07:42:48,197 INFO L85 PathProgramCache]: Analyzing trace with hash -77689536, now seen corresponding path program 1 times [2022-02-11 07:42:48,197 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 07:42:48,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575279949] [2022-02-11 07:42:48,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 07:42:48,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 07:42:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 07:42:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2022-02-11 07:42:48,251 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 07:42:48,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575279949] [2022-02-11 07:42:48,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575279949] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 07:42:48,252 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 07:42:48,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-11 07:42:48,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70671082] [2022-02-11 07:42:48,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 07:42:48,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 07:42:48,252 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 07:42:48,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 07:42:48,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-11 07:42:48,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:42:48,254 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 07:42:48,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 07:42:48,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:42:48,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 07:42:48,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 07:42:48,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-11 07:42:48,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-02-11 07:42:48,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-02-11 07:42:48,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:42:51,782 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse20 (* (- 1) c_~j~0)) (.cse14 (* (- 1) c_~i~0)) (.cse25 (* 2 c_~cur~0))) (let ((.cse0 (+ c_~prev~0 c_~cur~0)) (.cse4 (+ .cse25 c_~prev~0)) (.cse9 (div (+ (- 2) .cse14 c_~cur~0) (- 2))) (.cse7 (+ c_~next~0 1)) (.cse3 (+ c_~prev~0 c_~next~0)) (.cse6 (div (+ (- 2) .cse20 c_~cur~0) (- 2))) (.cse10 (+ c_~prev~0 1 c_~cur~0)) (.cse19 (+ (* 2 c_~next~0) 4 c_~cur~0)) (.cse15 (+ .cse25 3 c_~prev~0)) (.cse18 (+ 2 c_~next~0 c_~cur~0)) (.cse16 (+ c_~next~0 c_~cur~0))) (and (forall ((v_~cur~0_28 Int) (aux_div_v_~next~0_24_56 Int) (aux_mod_v_~next~0_24_56 Int)) (or (< (+ aux_mod_v_~next~0_24_56 c_~j~0 8) (+ c_~prev~0 (* 2 v_~cur~0_28) (* 2 aux_div_v_~next~0_24_56) c_~cur~0)) (< v_~cur~0_28 (+ (* 2 c_~cur~0) c_~prev~0)) (<= (+ (* 5 aux_div_v_~next~0_24_56) v_~cur~0_28) (+ (* aux_mod_v_~next~0_24_56 2) 20 (* 2 c_~j~0))) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2))) (<= c_~i~0 .cse0) (forall ((v_~cur~0_34 Int)) (or (and (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse1 (* 2 v_~cur~0_32))) (or (< v_~prev~0_30 (+ v_~cur~0_34 v_~cur~0_32 c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (> 0 aux_mod_v_~next~0_24_56) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~i~0))) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~i~0 10) (+ .cse1 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) v_~cur~0_34 c_~cur~0)) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2) (< v_~cur~0_32 (+ (* 2 v_~cur~0_34) c_~cur~0)) (< aux_div_v_~cur~0_28_51 (+ .cse1 v_~cur~0_34 1 c_~cur~0))))) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse2 (* 2 v_~cur~0_32))) (or (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~j~0 10) (+ .cse2 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) v_~cur~0_34 c_~cur~0)) (< v_~prev~0_30 (+ v_~cur~0_34 v_~cur~0_32 c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~j~0))) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2) (< v_~cur~0_32 (+ (* 2 v_~cur~0_34) c_~cur~0)) (< aux_div_v_~cur~0_28_51 (+ .cse2 v_~cur~0_34 1 c_~cur~0)))))) (< v_~cur~0_34 (+ c_~prev~0 c_~cur~0)))) (<= c_~j~0 c_~next~0) (<= c_~i~0 .cse3) (<= c_~j~0 |c_ULTIMATE.start_main_~correct~0#1|) (<= c_~j~0 .cse4) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int) (v_~cur~0_34 Int)) (let ((.cse5 (* 2 v_~cur~0_32))) (or (< v_~cur~0_34 (+ (* 2 c_~cur~0) c_~prev~0)) (< v_~cur~0_32 (+ c_~prev~0 (* 2 v_~cur~0_34) c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~j~0 10) (+ .cse5 c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) v_~cur~0_34 c_~cur~0)) (< v_~prev~0_30 (+ c_~prev~0 v_~cur~0_34 v_~cur~0_32 c_~cur~0)) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~j~0))) (< aux_div_v_~cur~0_28_51 (+ .cse5 c_~prev~0 v_~cur~0_34 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2)))) (<= .cse6 .cse7) (forall ((aux_div_v_~next~0_24_56 Int) (aux_mod_v_~next~0_24_56 Int)) (or (not (<= (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~next~0_24_56)) (+ aux_mod_v_~next~0_24_56 c_~i~0 8))) (<= (+ (* 5 aux_div_v_~next~0_24_56) c_~cur~0) (+ (* aux_mod_v_~next~0_24_56 2) 20 (* 2 c_~i~0))) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2))) (forall ((v_~prev~0_30 Int)) (or (and (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (aux_mod_v_~next~0_24_56 Int)) (or (< aux_div_v_~cur~0_28_51 (+ c_~prev~0 1 c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (> 0 aux_mod_v_~next~0_24_56) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~i~0))) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~i~0 10) (+ c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) c_~cur~0)))) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (aux_mod_v_~next~0_24_56 Int)) (or (< aux_div_v_~cur~0_28_51 (+ c_~prev~0 1 c_~cur~0)) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~j~0 10) (+ c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~j~0))) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2)))) (not (<= c_~cur~0 v_~prev~0_30)))) (<= c_~i~0 c_~next~0) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int) (v_~cur~0_34 Int)) (let ((.cse8 (* 2 v_~cur~0_32))) (or (< v_~cur~0_34 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~i~0 10) (+ .cse8 c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) v_~cur~0_34 c_~cur~0)) (< v_~cur~0_32 (+ c_~prev~0 (* 2 v_~cur~0_34) c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (< v_~prev~0_30 (+ c_~prev~0 v_~cur~0_34 v_~cur~0_32 c_~cur~0)) (< aux_div_v_~cur~0_28_51 (+ .cse8 c_~prev~0 v_~cur~0_34 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_24_56) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~i~0))) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2)))) (<= .cse9 .cse10) (forall ((v_~cur~0_32 Int)) (or (and (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse11 (* 2 v_~cur~0_32))) (or (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~j~0 10) (+ .cse11 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~j~0))) (< aux_div_v_~cur~0_28_51 (+ .cse11 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2) (< v_~prev~0_30 (+ v_~cur~0_32 c_~cur~0))))) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse12 (* 2 v_~cur~0_32))) (or (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~i~0 10) (+ .cse12 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (< aux_div_v_~cur~0_28_51 (+ .cse12 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_24_56) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~i~0))) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2) (< v_~prev~0_30 (+ v_~cur~0_32 c_~cur~0)))))) (< v_~cur~0_32 (+ c_~prev~0 c_~cur~0)))) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse13 (* 2 v_~cur~0_32))) (or (< v_~prev~0_30 (+ c_~prev~0 v_~cur~0_32 c_~cur~0)) (< v_~cur~0_32 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~cur~0_28_51) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~j~0 10) (+ .cse13 c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) c_~cur~0)) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~j~0))) (> 0 aux_mod_v_~next~0_24_56) (< aux_div_v_~cur~0_28_51 (+ .cse13 c_~prev~0 1 c_~cur~0)) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2)))) (<= (div (+ c_~prev~0 .cse14 (- 6) c_~cur~0) (- 2)) .cse15) (<= c_~j~0 c_~cur~0) (forall ((v_~cur~0_28 Int) (aux_div_v_~next~0_24_56 Int) (aux_mod_v_~next~0_24_56 Int)) (or (< (+ aux_mod_v_~next~0_24_56 c_~i~0 8) (+ c_~prev~0 (* 2 v_~cur~0_28) (* 2 aux_div_v_~next~0_24_56) c_~cur~0)) (< v_~cur~0_28 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2) (<= (+ (* 5 aux_div_v_~next~0_24_56) v_~cur~0_28) (+ (* aux_mod_v_~next~0_24_56 2) 20 (* 2 c_~i~0))))) (forall ((v_~cur~0_28 Int)) (or (< v_~cur~0_28 (+ c_~prev~0 c_~cur~0)) (and (forall ((aux_div_v_~next~0_24_56 Int) (aux_mod_v_~next~0_24_56 Int)) (or (< (+ aux_mod_v_~next~0_24_56 c_~i~0 8) (+ (* 2 v_~cur~0_28) (* 2 aux_div_v_~next~0_24_56) c_~cur~0)) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2) (<= (+ (* 5 aux_div_v_~next~0_24_56) v_~cur~0_28) (+ (* aux_mod_v_~next~0_24_56 2) 20 (* 2 c_~i~0))))) (forall ((aux_div_v_~next~0_24_56 Int) (aux_mod_v_~next~0_24_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_24_56) v_~cur~0_28) (+ (* aux_mod_v_~next~0_24_56 2) 20 (* 2 c_~j~0))) (< (+ aux_mod_v_~next~0_24_56 c_~j~0 8) (+ (* 2 v_~cur~0_28) (* 2 aux_div_v_~next~0_24_56) c_~cur~0)) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2)))))) (<= c_~j~0 .cse16) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse17 (* 2 c_~cur~0))) (or (< aux_div_v_~cur~0_28_51 (+ .cse17 c_~prev~0 1)) (> 0 aux_mod_v_~cur~0_28_51) (< v_~prev~0_30 (+ c_~prev~0 c_~cur~0)) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~j~0 10) (+ .cse17 c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4))) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~j~0))) (> 0 aux_mod_v_~next~0_24_56) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2)))) (<= c_~j~0 .cse0) (<= c_~i~0 .cse4) (<= .cse9 .cse7) (forall ((aux_div_v_~next~0_24_56 Int) (aux_mod_v_~next~0_24_56 Int)) (or (not (<= (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~next~0_24_56)) (+ aux_mod_v_~next~0_24_56 c_~j~0 8))) (> 0 aux_mod_v_~next~0_24_56) (<= (+ (* 5 aux_div_v_~next~0_24_56) c_~cur~0) (+ (* aux_mod_v_~next~0_24_56 2) 20 (* 2 c_~j~0))) (>= aux_mod_v_~next~0_24_56 2))) (<= (div (+ .cse14 (- 4) c_~next~0) (- 2)) .cse18) (<= 0 c_~prev~0) (<= (div (+ .cse14 c_~next~0 (- 8) c_~cur~0) (- 2)) .cse19) (<= c_~j~0 .cse3) (<= c_~i~0 |c_ULTIMATE.start_main_~correct~0#1|) (<= .cse6 .cse10) (<= c_~j~0 |c_ULTIMATE.start_fib_#res#1|) (<= (div (+ .cse20 c_~next~0 (- 8) c_~cur~0) (- 2)) .cse19) (<= c_~i~0 c_~cur~0) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse21 (* 2 v_~cur~0_32))) (or (< v_~prev~0_30 (+ c_~prev~0 v_~cur~0_32 c_~cur~0)) (< v_~cur~0_32 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~i~0 10) (+ .cse21 c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (> 0 aux_mod_v_~next~0_24_56) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~i~0))) (< aux_div_v_~cur~0_28_51 (+ .cse21 c_~prev~0 1 c_~cur~0)) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2)))) (<= c_~i~0 |c_ULTIMATE.start_fib_#res#1|) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (aux_mod_v_~next~0_24_56 Int)) (let ((.cse22 (* 2 c_~cur~0))) (or (< aux_div_v_~cur~0_28_51 (+ .cse22 c_~prev~0 1)) (> 0 aux_mod_v_~cur~0_28_51) (< v_~prev~0_30 (+ c_~prev~0 c_~cur~0)) (> 0 aux_mod_v_~next~0_24_56) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~i~0))) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~i~0 10) (+ .cse22 c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4))) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2)))) (forall ((v_~j~0_16 Int)) (or (not (<= v_~j~0_16 1)) (and (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int) (v_~cur~0_34 Int)) (let ((.cse23 (* 2 v_~cur~0_32))) (or (< (+ aux_mod_v_~next~0_24_56 v_~j~0_16 (* 2 aux_mod_v_~cur~0_28_51) 10) (+ .cse23 c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) v_~cur~0_34 c_~cur~0)) (< v_~cur~0_34 (+ (* 2 c_~cur~0) c_~prev~0)) (< v_~cur~0_32 (+ c_~prev~0 (* 2 v_~cur~0_34) c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (< v_~prev~0_30 (+ c_~prev~0 v_~cur~0_34 v_~cur~0_32 c_~cur~0)) (< aux_div_v_~cur~0_28_51 (+ .cse23 c_~prev~0 v_~cur~0_34 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_24_56) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* v_~j~0_16 2))) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2)))) (forall ((aux_div_v_~next~0_24_56 Int) (aux_div_v_~cur~0_28_51 Int) (aux_mod_v_~cur~0_28_51 Int) (v_~prev~0_30 Int) (v_~cur~0_32 Int) (aux_mod_v_~next~0_24_56 Int) (v_~cur~0_34 Int)) (let ((.cse24 (* 2 v_~cur~0_32))) (or (< v_~cur~0_34 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ aux_mod_v_~next~0_24_56 (* 2 aux_mod_v_~cur~0_28_51) c_~i~0 10) (+ .cse24 c_~prev~0 (* 2 aux_div_v_~next~0_24_56) (* v_~prev~0_30 3) (* aux_div_v_~cur~0_28_51 4) v_~cur~0_34 c_~cur~0)) (< v_~cur~0_32 (+ c_~prev~0 (* 2 v_~cur~0_34) c_~cur~0)) (> 0 aux_mod_v_~cur~0_28_51) (< v_~prev~0_30 (+ c_~prev~0 v_~cur~0_34 v_~cur~0_32 c_~cur~0)) (< aux_div_v_~cur~0_28_51 (+ .cse24 c_~prev~0 v_~cur~0_34 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_24_56) (<= (+ v_~prev~0_30 (* 5 aux_div_v_~next~0_24_56) (* 2 aux_div_v_~cur~0_28_51)) (+ 21 (* aux_mod_v_~next~0_24_56 2) aux_mod_v_~cur~0_28_51 (* 2 c_~i~0))) (>= aux_mod_v_~next~0_24_56 2) (>= aux_mod_v_~cur~0_28_51 2))))))) (<= (div (+ c_~prev~0 .cse20 (- 6) c_~cur~0) (- 2)) .cse15) (<= (div (+ .cse20 (- 4) c_~next~0) (- 2)) .cse18) (<= c_~i~0 .cse16) (<= 1 c_~cur~0)))) is different from false [2022-02-11 07:42:51,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:42:51,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 07:42:51,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 07:42:51,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-11 07:42:51,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-11 07:42:51,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-02-11 07:42:51,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 07:42:51,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,ResultService [2022-02-11 07:42:51,844 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-11 07:42:51,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 07:42:51,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1689007187, now seen corresponding path program 1 times [2022-02-11 07:42:51,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 07:42:51,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774396378] [2022-02-11 07:42:51,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 07:42:51,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 07:42:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 07:42:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2022-02-11 07:42:51,905 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 07:42:51,905 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774396378] [2022-02-11 07:42:51,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774396378] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 07:42:51,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555768975] [2022-02-11 07:42:51,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 07:42:51,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 07:42:51,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 07:42:51,920 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 07:42:51,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-11 07:42:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 07:42:51,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-11 07:42:51,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 07:42:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2022-02-11 07:42:52,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 07:42:52,427 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2022-02-11 07:42:52,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555768975] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 07:42:52,427 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 07:42:52,427 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-11 07:42:52,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579552694] [2022-02-11 07:42:52,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 07:42:52,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-11 07:42:52,428 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 07:42:52,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-11 07:42:52,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-11 07:42:52,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:42:52,431 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 07:42:52,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 07:42:52,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:42:52,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 07:42:52,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-11 07:42:52,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-11 07:42:52,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-02-11 07:42:52,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2022-02-11 07:42:52,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 07:42:52,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:42:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 07:42:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 07:42:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-11 07:42:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-11 07:42:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-02-11 07:42:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-02-11 07:42:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 07:42:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-11 07:42:52,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-02-11 07:42:52,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,ResultService,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 07:42:52,828 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-11 07:42:52,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 07:42:52,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1989318246, now seen corresponding path program 1 times [2022-02-11 07:42:52,828 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 07:42:52,828 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501583603] [2022-02-11 07:42:52,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 07:42:52,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 07:42:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 07:42:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 0 proven. 653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 07:42:56,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 07:42:56,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501583603] [2022-02-11 07:42:56,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501583603] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 07:42:56,576 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47071822] [2022-02-11 07:42:56,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 07:42:56,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 07:42:56,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 07:42:56,577 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-11 07:42:56,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-11 07:42:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 07:42:56,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 49 conjunts are in the unsatisfiable core [2022-02-11 07:42:56,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 07:43:06,351 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 486 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-11 07:43:06,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2022-02-11 07:44:48,629 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-02-11 07:44:48,631 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-11 07:44:48,649 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 07:44:48,650 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 07:44:48,650 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-11 07:44:48,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-11 07:44:48,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 07:44:48,848 WARN L594 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 161 with TraceHistMax 14,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 2ms.. [2022-02-11 07:44:48,849 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-02-11 07:44:48,849 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-02-11 07:44:48,851 INFO L733 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-02-11 07:44:48,853 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-11 07:44:48,853 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-11 07:44:48,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.02 07:44:48 BasicIcfg [2022-02-11 07:44:48,855 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-11 07:44:48,855 INFO L158 Benchmark]: Toolchain (without parser) took 878798.34ms. Allocated memory was 187.7MB in the beginning and 364.9MB in the end (delta: 177.2MB). Free memory was 128.7MB in the beginning and 142.7MB in the end (delta: -14.0MB). Peak memory consumption was 163.5MB. Max. memory is 8.0GB. [2022-02-11 07:44:48,855 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 187.7MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-11 07:44:48,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 600.45ms. Allocated memory was 187.7MB in the beginning and 252.7MB in the end (delta: 65.0MB). Free memory was 128.4MB in the beginning and 215.2MB in the end (delta: -86.7MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-02-11 07:44:48,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.70ms. Allocated memory is still 252.7MB. Free memory was 215.2MB in the beginning and 213.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-11 07:44:48,856 INFO L158 Benchmark]: Boogie Preprocessor took 40.35ms. Allocated memory is still 252.7MB. Free memory was 213.1MB in the beginning and 212.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-11 07:44:48,856 INFO L158 Benchmark]: RCFGBuilder took 382.57ms. Allocated memory is still 252.7MB. Free memory was 212.0MB in the beginning and 198.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-02-11 07:44:48,856 INFO L158 Benchmark]: TraceAbstraction took 877691.09ms. Allocated memory was 252.7MB in the beginning and 364.9MB in the end (delta: 112.2MB). Free memory was 198.4MB in the beginning and 142.7MB in the end (delta: 55.8MB). Peak memory consumption was 168.5MB. Max. memory is 8.0GB. [2022-02-11 07:44:48,857 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.13ms. Allocated memory is still 187.7MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 600.45ms. Allocated memory was 187.7MB in the beginning and 252.7MB in the end (delta: 65.0MB). Free memory was 128.4MB in the beginning and 215.2MB in the end (delta: -86.7MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 79.70ms. Allocated memory is still 252.7MB. Free memory was 215.2MB in the beginning and 213.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.35ms. Allocated memory is still 252.7MB. Free memory was 213.1MB in the beginning and 212.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 382.57ms. Allocated memory is still 252.7MB. Free memory was 212.0MB in the beginning and 198.9MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 877691.09ms. Allocated memory was 252.7MB in the beginning and 364.9MB in the end (delta: 112.2MB). Free memory was 198.4MB in the beginning and 142.7MB in the end (delta: 55.8MB). Peak memory consumption was 168.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1517, positive: 1460, positive conditional: 461, positive unconditional: 999, negative: 57, negative conditional: 53, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7910, positive: 7892, positive conditional: 2349, positive unconditional: 5543, negative: 18, negative conditional: 6, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7910, positive: 7892, positive conditional: 2349, positive unconditional: 5543, negative: 18, negative conditional: 6, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7918, positive: 7892, positive conditional: 2049, positive unconditional: 5843, negative: 26, negative conditional: 8, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7918, positive: 7892, positive conditional: 361, positive unconditional: 7531, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7918, positive: 7892, positive conditional: 361, positive unconditional: 7531, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2052, positive: 2045, positive conditional: 4, positive unconditional: 2041, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2052, positive: 2031, positive conditional: 0, positive unconditional: 2031, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, positive: 14, positive conditional: 4, positive unconditional: 10, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, positive: 52, positive conditional: 7, positive unconditional: 46, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7918, positive: 5847, positive conditional: 357, positive unconditional: 5490, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 2052, unknown conditional: 4, unknown unconditional: 2048] , Statistics on independence cache: Total cache size (in pairs): 2052, Positive cache size: 2045, Positive conditional cache size: 4, Positive unconditional cache size: 2041, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Eliminated conditions: 1696, Maximal queried relation: 2, Independence queries for same thread: 51 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 65, Number of trivial persistent sets: 39, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1003, positive: 999, positive conditional: 0, positive unconditional: 999, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1517, positive: 1460, positive conditional: 461, positive unconditional: 999, negative: 57, negative conditional: 53, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7910, positive: 7892, positive conditional: 2349, positive unconditional: 5543, negative: 18, negative conditional: 6, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7910, positive: 7892, positive conditional: 2349, positive unconditional: 5543, negative: 18, negative conditional: 6, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7918, positive: 7892, positive conditional: 2049, positive unconditional: 5843, negative: 26, negative conditional: 8, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7918, positive: 7892, positive conditional: 361, positive unconditional: 7531, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7918, positive: 7892, positive conditional: 361, positive unconditional: 7531, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2052, positive: 2045, positive conditional: 4, positive unconditional: 2041, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2052, positive: 2031, positive conditional: 0, positive unconditional: 2031, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, positive: 14, positive conditional: 4, positive unconditional: 10, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, positive: 52, positive conditional: 7, positive unconditional: 46, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7918, positive: 5847, positive conditional: 357, positive unconditional: 5490, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 2052, unknown conditional: 4, unknown unconditional: 2048] , Statistics on independence cache: Total cache size (in pairs): 2052, Positive cache size: 2045, Positive conditional cache size: 4, Positive unconditional cache size: 2041, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Eliminated conditions: 1696, Maximal queried relation: 2, Independence queries for same thread: 51 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 726]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 161 with TraceHistMax 14,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 2ms.. - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 161 with TraceHistMax 14,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 2ms.. - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 161 with TraceHistMax 14,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 2ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 112 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 877.5s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 194.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 143, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 565.3s InterpolantComputationTime, 1375 NumberOfCodeBlocks, 1358 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1909 ConstructedInterpolants, 88 QuantifiedInterpolants, 19129 SizeOfPredicates, 70 NumberOfNonLiveVariables, 1178 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 3092/5099 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown