/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-MCRwithDepranks-Lazy-wrwc.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-820ea7a [2022-02-19 17:07:14,673 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-19 17:07:14,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-19 17:07:14,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-19 17:07:14,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-19 17:07:14,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-19 17:07:14,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-19 17:07:14,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-19 17:07:14,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-19 17:07:14,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-19 17:07:14,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-19 17:07:14,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-19 17:07:14,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-19 17:07:14,712 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-19 17:07:14,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-19 17:07:14,714 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-19 17:07:14,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-19 17:07:14,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-19 17:07:14,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-19 17:07:14,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-19 17:07:14,718 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-19 17:07:14,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-19 17:07:14,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-19 17:07:14,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-19 17:07:14,724 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-19 17:07:14,724 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-19 17:07:14,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-19 17:07:14,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-19 17:07:14,725 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-19 17:07:14,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-19 17:07:14,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-19 17:07:14,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-19 17:07:14,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-19 17:07:14,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-19 17:07:14,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-19 17:07:14,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-19 17:07:14,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-19 17:07:14,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-19 17:07:14,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-19 17:07:14,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-19 17:07:14,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-19 17:07:14,730 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-MCRwithDepranks-Lazy-wrwc.epf [2022-02-19 17:07:14,743 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-19 17:07:14,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-19 17:07:14,744 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-19 17:07:14,744 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-19 17:07:14,744 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-19 17:07:14,744 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-19 17:07:14,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-19 17:07:14,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-19 17:07:14,745 INFO L138 SettingsManager]: * Use SBE=true [2022-02-19 17:07:14,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-19 17:07:14,745 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-19 17:07:14,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-19 17:07:14,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-19 17:07:14,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-19 17:07:14,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-19 17:07:14,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-19 17:07:14,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-19 17:07:14,746 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-19 17:07:14,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-19 17:07:14,746 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-19 17:07:14,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-19 17:07:14,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-19 17:07:14,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-19 17:07:14,747 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-19 17:07:14,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-19 17:07:14,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-19 17:07:14,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-19 17:07:14,747 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-02-19 17:07:14,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-19 17:07:14,747 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-19 17:07:14,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-19 17:07:14,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-19 17:07:14,747 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-19 17:07:14,747 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-19 17:07:14,748 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-19 17:07:14,748 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-02-19 17:07:14,748 INFO L138 SettingsManager]: * MCR: Overapproximate write-read-write conflicts=false [2022-02-19 17:07:14,748 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-19 17:07:14,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-19 17:07:14,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-19 17:07:14,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-19 17:07:14,938 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-19 17:07:14,939 INFO L275 PluginConnector]: CDTParser initialized [2022-02-19 17:07:14,940 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-5.i [2022-02-19 17:07:14,980 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a46bfcd1e/131288a6c781438c8bc8d7f3a7f42788/FLAGbe3d62dfc [2022-02-19 17:07:15,330 INFO L306 CDTParser]: Found 1 translation units. [2022-02-19 17:07:15,330 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i [2022-02-19 17:07:15,355 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a46bfcd1e/131288a6c781438c8bc8d7f3a7f42788/FLAGbe3d62dfc [2022-02-19 17:07:15,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a46bfcd1e/131288a6c781438c8bc8d7f3a7f42788 [2022-02-19 17:07:15,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-19 17:07:15,713 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-19 17:07:15,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-19 17:07:15,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-19 17:07:15,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-19 17:07:15,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 05:07:15" (1/1) ... [2022-02-19 17:07:15,720 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44fe1f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:15, skipping insertion in model container [2022-02-19 17:07:15,720 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 05:07:15" (1/1) ... [2022-02-19 17:07:15,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-19 17:07:15,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-19 17:07:16,097 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_unsafe-5.i[30819,30832] [2022-02-19 17:07:16,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-19 17:07:16,106 INFO L203 MainTranslator]: Completed pre-run [2022-02-19 17:07:16,142 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_unsafe-5.i[30819,30832] [2022-02-19 17:07:16,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-19 17:07:16,172 INFO L208 MainTranslator]: Completed translation [2022-02-19 17:07:16,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:16 WrapperNode [2022-02-19 17:07:16,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-19 17:07:16,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-19 17:07:16,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-19 17:07:16,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-19 17:07:16,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:16" (1/1) ... [2022-02-19 17:07:16,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:16" (1/1) ... [2022-02-19 17:07:16,220 INFO L137 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2022-02-19 17:07:16,220 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-19 17:07:16,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-19 17:07:16,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-19 17:07:16,221 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-19 17:07:16,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:16" (1/1) ... [2022-02-19 17:07:16,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:16" (1/1) ... [2022-02-19 17:07:16,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:16" (1/1) ... [2022-02-19 17:07:16,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:16" (1/1) ... [2022-02-19 17:07:16,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:16" (1/1) ... [2022-02-19 17:07:16,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:16" (1/1) ... [2022-02-19 17:07:16,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:16" (1/1) ... [2022-02-19 17:07:16,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-19 17:07:16,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-19 17:07:16,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-19 17:07:16,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-19 17:07:16,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:16" (1/1) ... [2022-02-19 17:07:16,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-19 17:07:16,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:07:16,276 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-19 17:07:16,294 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-19 17:07:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-02-19 17:07:16,306 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-02-19 17:07:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-02-19 17:07:16,306 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-02-19 17:07:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-19 17:07:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-19 17:07:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-19 17:07:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-19 17:07:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-19 17:07:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-19 17:07:16,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-19 17:07:16,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-19 17:07:16,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-19 17:07:16,308 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-19 17:07:16,392 INFO L234 CfgBuilder]: Building ICFG [2022-02-19 17:07:16,393 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-19 17:07:16,503 INFO L275 CfgBuilder]: Performing block encoding [2022-02-19 17:07:16,508 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-19 17:07:16,508 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-19 17:07:16,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 05:07:16 BoogieIcfgContainer [2022-02-19 17:07:16,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-19 17:07:16,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-19 17:07:16,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-19 17:07:16,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-19 17:07:16,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 05:07:15" (1/3) ... [2022-02-19 17:07:16,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da5bb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 05:07:16, skipping insertion in model container [2022-02-19 17:07:16,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 05:07:16" (2/3) ... [2022-02-19 17:07:16,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da5bb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 05:07:16, skipping insertion in model container [2022-02-19 17:07:16,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 05:07:16" (3/3) ... [2022-02-19 17:07:16,522 INFO L111 eAbstractionObserver]: Analyzing ICFG fib_unsafe-5.i [2022-02-19 17:07:16,525 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-19 17:07:16,525 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-19 17:07:16,525 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-19 17:07:16,525 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-19 17:07:16,549 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,550 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,550 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,550 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,550 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,550 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,551 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,551 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,552 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,552 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,552 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,552 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,553 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,553 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,553 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,554 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,555 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,555 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,556 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,556 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,556 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,556 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,557 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,557 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,558 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,558 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,559 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,559 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,559 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,559 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,560 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,560 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,560 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,560 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,561 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,561 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,565 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,565 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,565 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,566 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,566 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,570 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,570 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,570 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,570 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,570 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 17:07:16,571 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-19 17:07:16,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-19 17:07:16,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:07:16,618 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-19 17:07:16,619 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-19 17:07:16,643 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-19 17:07:16,649 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, mLazyFiniteAutomaton=true, 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, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=false [2022-02-19 17:07:16,649 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-19 17:07:16,706 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 91 transitions and produced 92 states. [2022-02-19 17:07:16,707 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-19 17:07:16,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:07:16,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1927097680, now seen corresponding path program 1 times [2022-02-19 17:07:16,719 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:07:16,719 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252870856] [2022-02-19 17:07:16,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:07:16,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:07:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:07:16,902 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-19 17:07:16,903 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:07:16,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252870856] [2022-02-19 17:07:16,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252870856] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 17:07:16,904 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 17:07:16,904 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-19 17:07:16,905 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664263575] [2022-02-19 17:07:16,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 17:07:16,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-19 17:07:16,909 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:07:16,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-19 17:07:16,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-19 17:07:16,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:16,933 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:07:16,934 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-19 17:07:16,934 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:16,993 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 91 transitions and produced 92 states. [2022-02-19 17:07:16,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:16,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-19 17:07:16,994 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-19 17:07:16,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:07:16,995 INFO L85 PathProgramCache]: Analyzing trace with hash 560415153, now seen corresponding path program 1 times [2022-02-19 17:07:16,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:07:16,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23926178] [2022-02-19 17:07:16,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:07:17,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:07:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:07:17,092 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-19 17:07:17,093 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:07:17,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23926178] [2022-02-19 17:07:17,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23926178] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 17:07:17,093 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 17:07:17,093 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-19 17:07:17,093 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107696896] [2022-02-19 17:07:17,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 17:07:17,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-19 17:07:17,095 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:07:17,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-19 17:07:17,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-19 17:07:17,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:17,096 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:07:17,096 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-19 17:07:17,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:17,096 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:17,160 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 114 transitions and produced 115 states. [2022-02-19 17:07:17,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:17,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:07:17,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-19 17:07:17,161 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-19 17:07:17,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:07:17,161 INFO L85 PathProgramCache]: Analyzing trace with hash -951035470, now seen corresponding path program 1 times [2022-02-19 17:07:17,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:07:17,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579272025] [2022-02-19 17:07:17,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:07:17,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:07:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:07:17,244 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-19 17:07:17,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:07:17,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579272025] [2022-02-19 17:07:17,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579272025] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:07:17,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703528748] [2022-02-19 17:07:17,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:07:17,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:07:17,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:07:17,248 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-19 17:07:17,249 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-19 17:07:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:07:17,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-19 17:07:17,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:07:17,442 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-19 17:07:17,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:07:17,535 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-19 17:07:17,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703528748] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:07:17,535 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:07:17,535 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-19 17:07:17,535 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472697969] [2022-02-19 17:07:17,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:07:17,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-19 17:07:17,536 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:07:17,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-19 17:07:17,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-19 17:07:17,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:17,537 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:07:17,537 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-19 17:07:17,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:17,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:07:17,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:17,821 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 160 transitions and produced 161 states. [2022-02-19 17:07:17,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:07:17,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:07:17,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-19 17:07:18,060 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 [2022-02-19 17:07:18,063 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-19 17:07:18,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:07:18,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1666707666, now seen corresponding path program 2 times [2022-02-19 17:07:18,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:07:18,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798777920] [2022-02-19 17:07:18,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:07:18,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:07:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:07:18,187 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-19 17:07:18,187 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:07:18,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798777920] [2022-02-19 17:07:18,187 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798777920] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:07:18,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540253912] [2022-02-19 17:07:18,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-19 17:07:18,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:07:18,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:07:18,189 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-19 17:07:18,190 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-19 17:07:18,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-19 17:07:18,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-19 17:07:18,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-19 17:07:18,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:07:18,473 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-19 17:07:18,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:07:18,634 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-19 17:07:18,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540253912] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:07:18,634 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:07:18,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-19 17:07:18,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218355039] [2022-02-19 17:07:18,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:07:18,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-19 17:07:18,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:07:18,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-19 17:07:18,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-19 17:07:18,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:18,636 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:07:18,636 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-19 17:07:18,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:18,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:07:18,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:07:18,637 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:19,150 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 252 transitions and produced 249 states. [2022-02-19 17:07:19,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:19,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:07:19,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:07:19,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-19 17:07:19,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-19 17:07:19,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:07:19,369 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-19 17:07:19,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:07:19,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1283180782, now seen corresponding path program 3 times [2022-02-19 17:07:19,370 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:07:19,370 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908577914] [2022-02-19 17:07:19,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:07:19,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:07:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:07:19,531 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-19 17:07:19,532 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:07:19,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908577914] [2022-02-19 17:07:19,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908577914] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:07:19,537 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857054424] [2022-02-19 17:07:19,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-19 17:07:19,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:07:19,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:07:19,552 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-19 17:07:19,596 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-19 17:07:19,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-02-19 17:07:19,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-19 17:07:19,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-19 17:07:19,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:07:19,791 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-19 17:07:19,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:07:19,961 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-19 17:07:19,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857054424] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:07:19,961 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:07:19,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2022-02-19 17:07:19,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772293605] [2022-02-19 17:07:19,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:07:19,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-19 17:07:19,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:07:19,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-19 17:07:19,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2022-02-19 17:07:19,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:19,965 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:07:19,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.148148148148148) internal successors, (139), 27 states have internal predecessors, (139), 0 states have call successors, (0), 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-19 17:07:19,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:19,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:07:19,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:07:19,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-19 17:07:19,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:20,607 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 367 transitions and produced 355 states. [2022-02-19 17:07:20,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:07:20,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:07:20,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:07:20,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-19 17:07:20,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-19 17:07:20,625 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-19 17:07:20,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:07:20,824 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-19 17:07:20,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:07:20,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1938020081, now seen corresponding path program 4 times [2022-02-19 17:07:20,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:07:20,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472394479] [2022-02-19 17:07:20,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:07:20,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:07:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:07:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:07:21,642 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:07:21,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472394479] [2022-02-19 17:07:21,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472394479] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:07:21,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022304707] [2022-02-19 17:07:21,643 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-19 17:07:21,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:07:21,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:07:21,644 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-19 17:07:21,645 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-19 17:07:21,708 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-19 17:07:21,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-19 17:07:21,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 41 conjunts are in the unsatisfiable core [2022-02-19 17:07:21,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:07:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 335 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:07:24,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:11:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 472 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:11:50,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022304707] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:11:50,623 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:11:50,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 121 [2022-02-19 17:11:50,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729816159] [2022-02-19 17:11:50,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:11:50,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2022-02-19 17:11:50,625 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:11:50,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2022-02-19 17:11:50,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=13509, Unknown=65, NotChecked=0, Total=14520 [2022-02-19 17:11:50,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:11:50,643 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:11:50,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 121 states have (on average 3.15702479338843) internal successors, (382), 121 states have internal predecessors, (382), 0 states have call successors, (0), 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-19 17:11:50,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:11:50,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:11:50,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:11:50,646 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-19 17:11:50,647 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-02-19 17:11:50,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:12:03,611 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (* (- 1) c_~j~0)) (.cse8 (* (- 1) c_~i~0)) (.cse22 (* 2 c_~cur~0))) (let ((.cse4 (+ c_~prev~0 c_~next~0)) (.cse9 (+ .cse22 3 c_~prev~0)) (.cse11 (+ .cse22 c_~prev~0)) (.cse6 (+ c_~next~0 1)) (.cse10 (div (+ (- 3) .cse8 c_~cur~0) (- 2))) (.cse12 (div (+ .cse8 c_~next~0 (- 5)) (- 2))) (.cse3 (+ 2 c_~prev~0 c_~next~0)) (.cse7 (+ (* 2 c_~next~0) 4 c_~cur~0)) (.cse2 (div (+ .cse5 c_~next~0 (- 5)) (- 2))) (.cse13 (+ 2 c_~next~0 c_~cur~0)) (.cse18 (div (+ (- 3) .cse5 c_~cur~0) (- 2))) (.cse20 (+ c_~prev~0 1 c_~cur~0)) (.cse17 (+ c_~prev~0 c_~cur~0)) (.cse15 (+ c_~next~0 c_~cur~0))) (and (forall ((v_~cur~0_26 Int)) (or (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse0 (* 2 v_~cur~0_26))) (or (< v_~prev~0_24 (+ v_~cur~0_26 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse0 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse0 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56)))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse1 (* 2 v_~cur~0_26))) (or (< v_~prev~0_24 (+ v_~cur~0_26 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse1 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse1 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56))))) (< v_~cur~0_26 (+ c_~prev~0 c_~cur~0)))) (< c_~i~0 c_~cur~0) (<= .cse2 .cse3) (< c_~j~0 .cse4) (< (div (+ (- 1) c_~prev~0 .cse5) (- 2)) .cse6) (<= (div (+ (- 9) .cse5 c_~next~0 c_~cur~0) (- 2)) .cse7) (< c_~j~0 |c_ULTIMATE.start_main_~correct~0#1|) (<= (div (+ (- 7) c_~prev~0 .cse8 c_~cur~0) (- 2)) .cse9) (< c_~i~0 .cse4) (forall ((v_~prev~0_24 Int)) (or (not (<= c_~cur~0 v_~prev~0_24)) (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< aux_div_v_~cur~0_22_51 (+ c_~prev~0 1 c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (> 0 aux_mod_v_~next~0_20_56))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< aux_div_v_~cur~0_22_51 (+ c_~prev~0 1 c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (> 0 aux_mod_v_~next~0_20_56)))))) (<= .cse10 .cse6) (< c_~i~0 c_~next~0) (< c_~i~0 .cse11) (<= .cse12 .cse13) (< c_~i~0 |c_ULTIMATE.start_main_~correct~0#1|) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse14 (* 2 c_~cur~0))) (or (< v_~prev~0_24 (+ c_~prev~0 c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse14 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56))) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse14 c_~prev~0 1)) (> 0 aux_mod_v_~next~0_20_56)))) (<= (div (+ (- 7) c_~prev~0 .cse5 c_~cur~0) (- 2)) .cse9) (< c_~j~0 .cse15) (forall ((v_~cur~0_22 Int)) (or (< v_~cur~0_22 (+ c_~prev~0 c_~cur~0)) (and (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 c_~j~0 9) (+ (* 2 v_~cur~0_22) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~next~0_20_56))) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 9 c_~i~0) (+ (* 2 v_~cur~0_22) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~next~0_20_56)))))) (< c_~i~0 |c_ULTIMATE.start_fib_#res#1|) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse16 (* 2 c_~cur~0))) (or (< v_~prev~0_24 (+ c_~prev~0 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse16 c_~prev~0 1)) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse16 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56))) (> 0 aux_mod_v_~next~0_20_56)))) (< c_~j~0 .cse11) (< (div (+ (- 1) c_~prev~0 .cse8) (- 2)) .cse6) (< c_~j~0 .cse17) (<= .cse18 .cse6) (< c_~j~0 |c_ULTIMATE.start_fib_#res#1|) (<= 0 c_~prev~0) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse19 (* 2 v_~cur~0_26))) (or (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_26 c_~cur~0)) (< aux_div_v_~cur~0_22_51 (+ .cse19 c_~prev~0 1 c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse19 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56)))) (<= .cse10 .cse20) (<= .cse12 .cse3) (<= (div (+ (- 9) .cse8 c_~next~0 c_~cur~0) (- 2)) .cse7) (< c_~j~0 c_~cur~0) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 c_~j~0 9) (+ (* 2 v_~cur~0_22) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (>= aux_mod_v_~next~0_20_56 2) (< v_~cur~0_22 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56))) (< c_~i~0 c_~prev~0) (< c_~j~0 c_~prev~0) (<= .cse2 .cse13) (<= .cse18 .cse20) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (not (<= (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~next~0_20_56)) (+ aux_mod_v_~next~0_20_56 9 c_~i~0))) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) c_~cur~0) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~next~0_20_56))) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 9 c_~i~0) (+ (* 2 v_~cur~0_22) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (< v_~cur~0_22 (+ (* 2 c_~cur~0) c_~prev~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~next~0_20_56))) (< c_~j~0 c_~next~0) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) c_~cur~0) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (not (<= (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~next~0_20_56)) (+ aux_mod_v_~next~0_20_56 c_~j~0 9))) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~next~0_20_56))) (< c_~i~0 .cse17) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse21 (* 2 v_~cur~0_26))) (or (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse21 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_26 c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (< aux_div_v_~cur~0_22_51 (+ .cse21 c_~prev~0 1 c_~cur~0)) (> 0 aux_mod_v_~cur~0_22_51) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56)))) (<= c_~i~0 1) (< c_~i~0 .cse15) (<= 1 c_~cur~0)))) is different from false [2022-02-19 17:12:03,772 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 414 transitions and produced 385 states. [2022-02-19 17:12:03,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:12:03,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:12:03,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:12:03,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-19 17:12:03,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-19 17:12:03,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-02-19 17:12:03,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-19 17:12:03,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:12:03,994 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-19 17:12:03,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:12:03,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2006804384, now seen corresponding path program 1 times [2022-02-19 17:12:03,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:12:03,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047731994] [2022-02-19 17:12:03,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:12:03,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:12:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:12:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2022-02-19 17:12:04,069 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:12:04,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047731994] [2022-02-19 17:12:04,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047731994] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 17:12:04,070 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 17:12:04,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-19 17:12:04,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383255912] [2022-02-19 17:12:04,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 17:12:04,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-19 17:12:04,070 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:12:04,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-19 17:12:04,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-19 17:12:04,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:12:04,071 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:12:04,071 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-19 17:12:04,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:12:04,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:12:04,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:12:04,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-19 17:12:04,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-02-19 17:12:04,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-02-19 17:12:04,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:12:08,084 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (* (- 1) c_~j~0)) (.cse8 (* (- 1) c_~i~0)) (.cse24 (* 2 c_~cur~0))) (let ((.cse4 (+ c_~prev~0 c_~next~0)) (.cse9 (+ .cse24 3 c_~prev~0)) (.cse11 (+ .cse24 c_~prev~0)) (.cse6 (+ c_~next~0 1)) (.cse10 (div (+ (- 3) .cse8 c_~cur~0) (- 2))) (.cse12 (div (+ .cse8 c_~next~0 (- 5)) (- 2))) (.cse3 (+ 2 c_~prev~0 c_~next~0)) (.cse7 (+ (* 2 c_~next~0) 4 c_~cur~0)) (.cse2 (div (+ .cse5 c_~next~0 (- 5)) (- 2))) (.cse13 (+ 2 c_~next~0 c_~cur~0)) (.cse20 (div (+ (- 3) .cse5 c_~cur~0) (- 2))) (.cse22 (+ c_~prev~0 1 c_~cur~0)) (.cse19 (+ c_~prev~0 c_~cur~0)) (.cse15 (+ c_~next~0 c_~cur~0))) (and (forall ((v_~cur~0_26 Int)) (or (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse0 (* 2 v_~cur~0_26))) (or (< v_~prev~0_24 (+ v_~cur~0_26 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse0 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse0 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56)))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse1 (* 2 v_~cur~0_26))) (or (< v_~prev~0_24 (+ v_~cur~0_26 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse1 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse1 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56))))) (< v_~cur~0_26 (+ c_~prev~0 c_~cur~0)))) (< c_~i~0 c_~cur~0) (<= .cse2 .cse3) (< c_~j~0 .cse4) (< (div (+ (- 1) c_~prev~0 .cse5) (- 2)) .cse6) (<= (div (+ (- 9) .cse5 c_~next~0 c_~cur~0) (- 2)) .cse7) (< c_~j~0 |c_ULTIMATE.start_main_~correct~0#1|) (<= (div (+ (- 7) c_~prev~0 .cse8 c_~cur~0) (- 2)) .cse9) (< c_~i~0 .cse4) (forall ((v_~prev~0_24 Int)) (or (not (<= c_~cur~0 v_~prev~0_24)) (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< aux_div_v_~cur~0_22_51 (+ c_~prev~0 1 c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (> 0 aux_mod_v_~next~0_20_56))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< aux_div_v_~cur~0_22_51 (+ c_~prev~0 1 c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (> 0 aux_mod_v_~next~0_20_56)))))) (<= .cse10 .cse6) (< c_~i~0 c_~next~0) (< c_~i~0 .cse11) (<= .cse12 .cse13) (< c_~i~0 |c_ULTIMATE.start_main_~correct~0#1|) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse14 (* 2 c_~cur~0))) (or (< v_~prev~0_24 (+ c_~prev~0 c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse14 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56))) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse14 c_~prev~0 1)) (> 0 aux_mod_v_~next~0_20_56)))) (<= (div (+ (- 7) c_~prev~0 .cse5 c_~cur~0) (- 2)) .cse9) (< c_~j~0 .cse15) (forall ((v_~cur~0_22 Int)) (or (< v_~cur~0_22 (+ c_~prev~0 c_~cur~0)) (and (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 c_~j~0 9) (+ (* 2 v_~cur~0_22) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~next~0_20_56))) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 9 c_~i~0) (+ (* 2 v_~cur~0_22) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~next~0_20_56)))))) (< c_~i~0 |c_ULTIMATE.start_fib_#res#1|) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse16 (* 2 c_~cur~0))) (or (< v_~prev~0_24 (+ c_~prev~0 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse16 c_~prev~0 1)) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse16 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56))) (> 0 aux_mod_v_~next~0_20_56)))) (< c_~j~0 .cse11) (< (div (+ (- 1) c_~prev~0 .cse8) (- 2)) .cse6) (forall ((v_~j~0_8 Int)) (or (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse17 (* 2 v_~cur~0_26))) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 v_~j~0_8) (* aux_mod_v_~next~0_20_56 2))) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_26 c_~cur~0)) (< aux_div_v_~cur~0_22_51 (+ .cse17 c_~prev~0 1 c_~cur~0)) (> 0 aux_mod_v_~cur~0_22_51) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ aux_mod_v_~next~0_20_56 (* 2 aux_mod_v_~cur~0_22_51) 11 v_~j~0_8) (+ .cse17 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56)))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse18 (* 2 v_~cur~0_26))) (or (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse18 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_26 c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (< aux_div_v_~cur~0_22_51 (+ .cse18 c_~prev~0 1 c_~cur~0)) (> 0 aux_mod_v_~cur~0_22_51) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56))))) (not (<= v_~j~0_8 1)))) (< c_~j~0 .cse19) (<= .cse20 .cse6) (< c_~j~0 |c_ULTIMATE.start_fib_#res#1|) (<= 0 c_~prev~0) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse21 (* 2 v_~cur~0_26))) (or (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_26 c_~cur~0)) (< aux_div_v_~cur~0_22_51 (+ .cse21 c_~prev~0 1 c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse21 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56)))) (<= .cse10 .cse22) (<= .cse12 .cse3) (<= (div (+ (- 9) .cse8 c_~next~0 c_~cur~0) (- 2)) .cse7) (< c_~j~0 c_~cur~0) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 c_~j~0 9) (+ (* 2 v_~cur~0_22) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (>= aux_mod_v_~next~0_20_56 2) (< v_~cur~0_22 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56))) (< c_~i~0 c_~prev~0) (< c_~j~0 c_~prev~0) (<= .cse2 .cse13) (<= .cse20 .cse22) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (not (<= (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~next~0_20_56)) (+ aux_mod_v_~next~0_20_56 9 c_~i~0))) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) c_~cur~0) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~next~0_20_56))) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 9 c_~i~0) (+ (* 2 v_~cur~0_22) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (< v_~cur~0_22 (+ (* 2 c_~cur~0) c_~prev~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~next~0_20_56))) (< c_~j~0 c_~next~0) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) c_~cur~0) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (not (<= (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~next~0_20_56)) (+ aux_mod_v_~next~0_20_56 c_~j~0 9))) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~next~0_20_56))) (< c_~i~0 .cse19) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse23 (* 2 v_~cur~0_26))) (or (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse23 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_26 c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (< aux_div_v_~cur~0_22_51 (+ .cse23 c_~prev~0 1 c_~cur~0)) (> 0 aux_mod_v_~cur~0_22_51) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56)))) (< c_~i~0 .cse15) (<= 1 c_~cur~0)))) is different from false [2022-02-19 17:12:08,229 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 414 transitions and produced 388 states. [2022-02-19 17:12:08,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:12:08,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:12:08,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:12:08,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-19 17:12:08,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-19 17:12:08,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-19 17:12:08,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:12:08,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-19 17:12:08,230 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-19 17:12:08,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:12:08,231 INFO L85 PathProgramCache]: Analyzing trace with hash -240107661, now seen corresponding path program 1 times [2022-02-19 17:12:08,231 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:12:08,231 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31857937] [2022-02-19 17:12:08,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:12:08,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:12:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:12:08,304 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-02-19 17:12:08,305 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:12:08,305 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31857937] [2022-02-19 17:12:08,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31857937] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:12:08,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553287555] [2022-02-19 17:12:08,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:12:08,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:12:08,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:12:08,307 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-19 17:12:08,312 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-19 17:12:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:12:08,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-19 17:12:08,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:12:08,585 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-02-19 17:12:08,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:12:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-02-19 17:12:08,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553287555] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:12:08,758 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:12:08,758 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-19 17:12:08,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000450469] [2022-02-19 17:12:08,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:12:08,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-19 17:12:08,759 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:12:08,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-19 17:12:08,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-19 17:12:08,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:12:08,759 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:12:08,759 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-19 17:12:08,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:12:08,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:12:08,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:12:08,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-19 17:12:08,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-02-19 17:12:08,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-02-19 17:12:08,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:12:08,760 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:12:09,226 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 398 transitions and produced 380 states. [2022-02-19 17:12:09,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:12:09,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:12:09,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:12:09,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-19 17:12:09,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-19 17:12:09,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-19 17:12:09,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:12:09,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-19 17:12:09,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-19 17:12:09,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:12:09,446 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-19 17:12:09,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 17:12:09,446 INFO L85 PathProgramCache]: Analyzing trace with hash -440658106, now seen corresponding path program 1 times [2022-02-19 17:12:09,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 17:12:09,446 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315623004] [2022-02-19 17:12:09,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:12:09,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 17:12:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:12:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:12:11,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 17:12:11,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315623004] [2022-02-19 17:12:11,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315623004] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 17:12:11,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699391307] [2022-02-19 17:12:11,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 17:12:11,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 17:12:11,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 17:12:11,723 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-19 17:12:11,723 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-19 17:12:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 17:12:11,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 43 conjunts are in the unsatisfiable core [2022-02-19 17:12:11,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 17:12:17,973 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 335 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 17:12:17,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 17:13:56,088 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_~cur~0_39 Int)) (or (not (<= c_~next~0 v_~cur~0_39)) (forall ((v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~next~0_36 (+ c_~prev~0 (* 2 v_~cur~0_39))) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse1 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse0 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse0) .cse1) (< .cse1 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse0))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse3 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse2 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse2) .cse3) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse3 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse2)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))) (< v_~prev~0_37 (+ c_~prev~0 v_~cur~0_39)))))) is different from false [2022-02-19 17:16:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 463 refuted. 2 times theorem prover too weak. 0 trivial. 11 not checked. [2022-02-19 17:16:39,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699391307] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 17:16:39,731 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 17:16:39,731 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 127 [2022-02-19 17:16:39,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48556607] [2022-02-19 17:16:39,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 17:16:39,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 127 states [2022-02-19 17:16:39,737 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 17:16:39,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2022-02-19 17:16:39,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=936, Invalid=14770, Unknown=48, NotChecked=248, Total=16002 [2022-02-19 17:16:39,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:16:39,742 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 17:16:39,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 127 states, 127 states have (on average 3.220472440944882) internal successors, (409), 127 states have internal predecessors, (409), 0 states have call successors, (0), 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-19 17:16:39,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:16:39,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:16:39,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-19 17:16:39,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-19 17:16:39,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-02-19 17:16:39,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-02-19 17:16:39,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 17:16:39,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-02-19 17:16:39,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 17:17:58,871 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (* (- 1) c_~j~0)) (.cse2 (+ c_~next~0 1)) (.cse12 (* c_~next~0 55)) (.cse11 (* (- 1) c_~i~0)) (.cse1 (+ 2 c_~prev~0 c_~next~0))) (and (= (+ (- 1) c_~i~0) 0) (<= (div (+ .cse0 c_~next~0 (- 5)) (- 2)) .cse1) (< (div (+ (- 1) c_~prev~0 .cse0) (- 2)) .cse2) (forall ((v_~cur~0_35 Int)) (or (not (<= c_~next~0 v_~cur~0_35)) (and (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (not (<= (+ (* 2 v_~cur~0_35) c_~prev~0 (* 2 aux_div_v_~next~0_33_56)) (+ aux_mod_v_~next~0_33_56 9 c_~i~0))) (> 0 aux_mod_v_~next~0_33_56) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2))))) (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (not (<= (+ (* 2 v_~cur~0_35) c_~prev~0 (* 2 aux_div_v_~next~0_33_56)) (+ aux_mod_v_~next~0_33_56 c_~j~0 9)))))))) (forall ((aux_mod_v_~cur~0_34_56 Int) (aux_div_v_~cur~0_34_56 Int)) (or (> 0 aux_mod_v_~cur~0_34_56) (>= aux_mod_v_~cur~0_34_56 2) (not (<= (+ c_~prev~0 c_~next~0 (* 2 aux_div_v_~cur~0_34_56)) (+ 7 c_~i~0 aux_mod_v_~cur~0_34_56))) (<= (+ (* 5 aux_div_v_~cur~0_34_56) c_~j~0 c_~prev~0) (+ (* 2 aux_mod_v_~cur~0_34_56) (* 2 c_~i~0) 17)))) (forall ((aux_mod_v_~cur~0_34_56 Int) (aux_div_v_~cur~0_34_56 Int)) (or (<= (+ (* 5 aux_div_v_~cur~0_34_56) c_~prev~0) (+ (* 2 aux_mod_v_~cur~0_34_56) (* 2 c_~j~0) 17)) (> 0 aux_mod_v_~cur~0_34_56) (>= aux_mod_v_~cur~0_34_56 2) (not (<= (+ c_~prev~0 c_~next~0 (* 2 aux_div_v_~cur~0_34_56)) (+ 7 c_~j~0 aux_mod_v_~cur~0_34_56))))) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~next~0_36 (+ c_~next~0 (* 2 v_~cur~0_39))) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse4 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse3 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse3) .cse4) (< .cse4 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse3))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse6 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse5 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse5) .cse6) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse6 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse5)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))) (< v_~cur~0_39 (+ c_~prev~0 c_~next~0)) (< v_~prev~0_37 (+ c_~next~0 v_~cur~0_39)))) (forall ((v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse8 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse7 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse7) .cse8) (< .cse8 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse7))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse10 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse9 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse9) .cse10) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse10 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse9)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))) (< v_~next~0_36 (+ c_~prev~0 c_~next~0)) (< v_~prev~0_37 c_~next~0))) (< (+ (div (+ (- 1) c_~prev~0 .cse11) (- 2)) c_~j~0) .cse2) (forall ((aux_div_v_~next~0_33_56 Int) (v_~cur~0_35 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< (+ aux_mod_v_~next~0_33_56 c_~j~0 9) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (< v_~cur~0_35 (+ c_~prev~0 c_~next~0)))) (= (+ (- 1) c_~j~0) 0) (<= 144 (+ .cse12 (* 34 c_~cur~0))) (<= 144 (+ .cse12 (* c_~prev~0 34))) (<= (+ (div (+ .cse11 c_~next~0 (- 5)) (- 2)) c_~j~0) .cse1) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse14 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse13 (+ (* 3 c_~prev~0) c_~next~0))) (or (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 5 c_~prev~0) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 2 c_~next~0)) 4) (* 2 aux_div_v_~cur~0_35_51))) (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (< .cse13 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse14)) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse14) .cse13)))) (<= c_~j~0 1) (<= (+ 1 c_~cur~0) c_~next~0) (forall ((aux_div_v_~next~0_33_56 Int) (v_~cur~0_35 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< v_~cur~0_35 (+ c_~prev~0 c_~next~0)) (< (+ aux_mod_v_~next~0_33_56 9 c_~i~0) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse16 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse15 (+ (* 3 c_~prev~0) c_~next~0))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 5 c_~prev~0) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 2 c_~next~0)) 4) (* 2 aux_div_v_~cur~0_35_51))) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< .cse15 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse16)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse16) .cse15)))) (<= c_~i~0 1) (<= 1 c_~cur~0))) is different from false [2022-02-19 17:19:43,218 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse37 (* 2 c_~cur~0))) (let ((.cse3 (+ c_~next~0 1)) (.cse0 (* (- 1) c_~j~0)) (.cse27 (* c_~next~0 55)) (.cse2 (* c_~prev~0 34)) (.cse1 (+ 2 c_~prev~0 c_~next~0)) (.cse21 (* (- 1) c_~i~0)) (.cse26 (+ .cse37 3 c_~prev~0)) (.cse28 (+ .cse37 c_~prev~0))) (and (= (+ (- 1) c_~i~0) 0) (<= (div (+ .cse0 c_~next~0 (- 5)) (- 2)) .cse1) (<= 144 (+ .cse2 (* 55 c_~cur~0))) (< (div (+ (- 1) c_~prev~0 .cse0) (- 2)) .cse3) (forall ((v_~cur~0_35 Int)) (or (not (<= c_~next~0 v_~cur~0_35)) (and (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (not (<= (+ (* 2 v_~cur~0_35) c_~prev~0 (* 2 aux_div_v_~next~0_33_56)) (+ aux_mod_v_~next~0_33_56 9 c_~i~0))) (> 0 aux_mod_v_~next~0_33_56) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2))))) (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (not (<= (+ (* 2 v_~cur~0_35) c_~prev~0 (* 2 aux_div_v_~next~0_33_56)) (+ aux_mod_v_~next~0_33_56 c_~j~0 9)))))))) (forall ((aux_mod_v_~cur~0_34_56 Int) (aux_div_v_~cur~0_34_56 Int)) (or (> 0 aux_mod_v_~cur~0_34_56) (>= aux_mod_v_~cur~0_34_56 2) (not (<= (+ c_~prev~0 c_~next~0 (* 2 aux_div_v_~cur~0_34_56)) (+ 7 c_~i~0 aux_mod_v_~cur~0_34_56))) (<= (+ (* 5 aux_div_v_~cur~0_34_56) c_~j~0 c_~prev~0) (+ (* 2 aux_mod_v_~cur~0_34_56) (* 2 c_~i~0) 17)))) (forall ((aux_mod_v_~cur~0_34_56 Int) (aux_div_v_~cur~0_34_56 Int)) (or (<= (+ (* 5 aux_div_v_~cur~0_34_56) c_~prev~0) (+ (* 2 aux_mod_v_~cur~0_34_56) (* 2 c_~j~0) 17)) (> 0 aux_mod_v_~cur~0_34_56) (>= aux_mod_v_~cur~0_34_56 2) (not (<= (+ c_~prev~0 c_~next~0 (* 2 aux_div_v_~cur~0_34_56)) (+ 7 c_~j~0 aux_mod_v_~cur~0_34_56))))) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~next~0_36 (+ c_~next~0 (* 2 v_~cur~0_39))) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse5 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse4 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse4) .cse5) (< .cse5 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse4))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse7 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse6 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse6) .cse7) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse7 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse6)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))) (< v_~cur~0_39 (+ c_~prev~0 c_~next~0)) (< v_~prev~0_37 (+ c_~next~0 v_~cur~0_39)))) (forall ((v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse9 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse8 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse8) .cse9) (< .cse9 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse8))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse11 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse10 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse10) .cse11) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse11 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse10)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))) (< v_~next~0_36 (+ c_~prev~0 c_~next~0)) (< v_~prev~0_37 c_~next~0))) (forall ((v_~next~0_36 Int)) (or (not (<= (+ c_~prev~0 c_~cur~0) v_~next~0_36)) (forall ((v_~prev~0_37 Int)) (or (not (<= c_~cur~0 v_~prev~0_37)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse13 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse12 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse12) .cse13) (< .cse13 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse12))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse15 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse14 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse14) .cse15) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse15 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse14)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))))))) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~prev~0_37 (+ c_~prev~0 v_~cur~0_39 c_~cur~0)) (and (forall ((aux_div_v_~j~0_10_159 Int) (aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse16 (* v_~prev~0_37 3))) (let ((.cse17 (* aux_div_v_~j~0_10_159 2)) (.cse18 (div (+ (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (- 5) (* 5 v_~prev~0_37)) 2)) (.cse20 (+ .cse16 v_~next~0_36)) (.cse19 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 aux_div_v_~j~0_10_159 (* 2 aux_div_v_~cur~0_35_51))) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= (+ .cse16 .cse17) (+ c_~i~0 12 .cse18 .cse19)) (<= (+ .cse17 1) (+ v_~next~0_36 .cse18)) (<= (+ c_~i~0 15 .cse19) .cse20) (< .cse20 (+ c_~i~0 12 .cse19)))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 15 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (+ (* v_~prev~0_37 3) v_~next~0_36)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51)))))) (< v_~cur~0_39 (+ (* 2 c_~cur~0) c_~prev~0)) (< v_~next~0_36 (+ c_~prev~0 (* 2 v_~cur~0_39) c_~cur~0)))) (< (+ (div (+ (- 1) c_~prev~0 .cse21) (- 2)) c_~j~0) .cse3) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~cur~0_39 (+ c_~prev~0 c_~cur~0)) (< v_~prev~0_37 (+ v_~cur~0_39 c_~cur~0)) (< v_~next~0_36 (+ (* 2 v_~cur~0_39) c_~cur~0)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse23 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse22 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse22) .cse23) (< .cse23 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse22))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse25 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse24 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse24) .cse25) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse25 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse24)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))))) (forall ((aux_div_v_~next~0_33_56 Int) (v_~cur~0_35 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< (+ aux_mod_v_~next~0_33_56 c_~j~0 9) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (< v_~cur~0_35 (+ c_~prev~0 c_~next~0)))) (<= (div (+ (- 7) c_~prev~0 .cse0 c_~cur~0) (- 2)) .cse26) (= (+ (- 1) c_~j~0) 0) (<= 144 (+ .cse27 (* 34 c_~cur~0))) (<= 144 (+ .cse27 .cse2)) (<= (+ (div (+ .cse21 c_~next~0 (- 5)) (- 2)) c_~j~0) .cse1) (< c_~j~0 .cse28) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse30 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse29 (+ (* 3 c_~prev~0) c_~next~0))) (or (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 5 c_~prev~0) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 2 c_~next~0)) 4) (* 2 aux_div_v_~cur~0_35_51))) (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (< .cse29 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse30)) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse30) .cse29)))) (forall ((v_~cur~0_35 Int)) (or (< v_~cur~0_35 (+ c_~prev~0 c_~cur~0)) (and (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< (+ aux_mod_v_~next~0_33_56 c_~j~0 9) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))))) (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (< (+ aux_mod_v_~next~0_33_56 9 c_~i~0) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_56) c_~cur~0)) (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2)))))))) (<= 2 c_~cur~0) (<= c_~j~0 1) (<= (+ 1 c_~cur~0) c_~next~0) (forall ((aux_div_v_~next~0_33_56 Int) (v_~cur~0_35 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< v_~cur~0_35 (+ c_~prev~0 c_~next~0)) (< (+ aux_mod_v_~next~0_33_56 9 c_~i~0) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2))))) (<= 144 (+ (* c_~next~0 34) (* 21 c_~cur~0))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse32 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse31 (+ (* 3 c_~prev~0) c_~next~0))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 5 c_~prev~0) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 2 c_~next~0)) 4) (* 2 aux_div_v_~cur~0_35_51))) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< .cse31 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse32)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse32) .cse31)))) (<= (+ (div (+ (- 7) c_~prev~0 .cse21 c_~cur~0) (- 2)) c_~j~0) .cse26) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~prev~0_37 (+ c_~prev~0 v_~cur~0_39 c_~cur~0)) (< v_~cur~0_39 (+ (* 2 c_~cur~0) c_~prev~0)) (and (forall ((aux_div_v_~j~0_10_159 Int) (aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (or (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 aux_div_v_~j~0_10_159 (* 2 aux_div_v_~cur~0_35_51))) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= (+ 16 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (+ (* v_~prev~0_37 3) v_~next~0_36)) (<= (+ (* aux_div_v_~j~0_10_159 2) 1) (+ v_~next~0_36 (div (+ (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (- 5) (* 5 v_~prev~0_37)) 2))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 15 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (+ (* v_~prev~0_37 3) v_~next~0_36)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51)))))) (< v_~next~0_36 (+ c_~prev~0 (* 2 v_~cur~0_39) c_~cur~0)))) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~prev~0_37 (+ c_~prev~0 v_~cur~0_39 c_~cur~0)) (< v_~cur~0_39 (+ (* 2 c_~cur~0) c_~prev~0)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse34 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse33 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse33) .cse34) (< .cse34 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse33))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse36 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse35 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse35) .cse36) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse36 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse35)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))) (< v_~next~0_36 (+ c_~prev~0 (* 2 v_~cur~0_39) c_~cur~0)))) (< (+ c_~i~0 (* 2 c_~j~0)) .cse28) (<= c_~i~0 1)))) is different from false [2022-02-19 17:20:56,655 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse36 (* 2 c_~cur~0))) (let ((.cse4 (+ c_~next~0 1)) (.cse0 (* (- 1) c_~j~0)) (.cse25 (* c_~next~0 55)) (.cse3 (* c_~prev~0 34)) (.cse1 (+ 2 c_~prev~0 c_~next~0)) (.cse23 (* c_~next~0 34)) (.cse2 (+ c_~prev~0 c_~next~0)) (.cse18 (* (- 1) c_~i~0)) (.cse24 (+ .cse36 3 c_~prev~0)) (.cse29 (+ c_~i~0 (* 2 c_~j~0))) (.cse26 (+ .cse36 c_~prev~0))) (and (= (+ (- 1) c_~i~0) 0) (<= (div (+ .cse0 c_~next~0 (- 5)) (- 2)) .cse1) (< c_~j~0 .cse2) (<= 144 (+ .cse3 (* 55 c_~cur~0))) (< (div (+ (- 1) c_~prev~0 .cse0) (- 2)) .cse4) (forall ((v_~cur~0_35 Int)) (or (not (<= c_~next~0 v_~cur~0_35)) (and (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (not (<= (+ (* 2 v_~cur~0_35) c_~prev~0 (* 2 aux_div_v_~next~0_33_56)) (+ aux_mod_v_~next~0_33_56 9 c_~i~0))) (> 0 aux_mod_v_~next~0_33_56) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2))))) (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (not (<= (+ (* 2 v_~cur~0_35) c_~prev~0 (* 2 aux_div_v_~next~0_33_56)) (+ aux_mod_v_~next~0_33_56 c_~j~0 9)))))))) (forall ((aux_mod_v_~cur~0_34_56 Int) (aux_div_v_~cur~0_34_56 Int)) (or (> 0 aux_mod_v_~cur~0_34_56) (>= aux_mod_v_~cur~0_34_56 2) (not (<= (+ c_~prev~0 c_~next~0 (* 2 aux_div_v_~cur~0_34_56)) (+ 7 c_~i~0 aux_mod_v_~cur~0_34_56))) (<= (+ (* 5 aux_div_v_~cur~0_34_56) c_~j~0 c_~prev~0) (+ (* 2 aux_mod_v_~cur~0_34_56) (* 2 c_~i~0) 17)))) (forall ((aux_mod_v_~cur~0_34_56 Int) (aux_div_v_~cur~0_34_56 Int)) (or (<= (+ (* 5 aux_div_v_~cur~0_34_56) c_~prev~0) (+ (* 2 aux_mod_v_~cur~0_34_56) (* 2 c_~j~0) 17)) (> 0 aux_mod_v_~cur~0_34_56) (>= aux_mod_v_~cur~0_34_56 2) (not (<= (+ c_~prev~0 c_~next~0 (* 2 aux_div_v_~cur~0_34_56)) (+ 7 c_~j~0 aux_mod_v_~cur~0_34_56))))) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~next~0_36 (+ c_~next~0 (* 2 v_~cur~0_39))) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse6 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse5 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse5) .cse6) (< .cse6 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse5))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse8 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse7 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse7) .cse8) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse8 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse7)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))) (< v_~cur~0_39 (+ c_~prev~0 c_~next~0)) (< v_~prev~0_37 (+ c_~next~0 v_~cur~0_39)))) (<= 3 c_~cur~0) (forall ((v_~next~0_36 Int)) (or (not (<= (+ c_~prev~0 c_~cur~0) v_~next~0_36)) (forall ((v_~prev~0_37 Int)) (or (not (<= c_~cur~0 v_~prev~0_37)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse10 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse9 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse9) .cse10) (< .cse10 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse9))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse12 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse11 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse11) .cse12) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse12 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse11)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))))))) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~prev~0_37 (+ c_~prev~0 v_~cur~0_39 c_~cur~0)) (and (forall ((aux_div_v_~j~0_10_159 Int) (aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse13 (* v_~prev~0_37 3))) (let ((.cse14 (* aux_div_v_~j~0_10_159 2)) (.cse15 (div (+ (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (- 5) (* 5 v_~prev~0_37)) 2)) (.cse17 (+ .cse13 v_~next~0_36)) (.cse16 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 aux_div_v_~j~0_10_159 (* 2 aux_div_v_~cur~0_35_51))) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= (+ .cse13 .cse14) (+ c_~i~0 12 .cse15 .cse16)) (<= (+ .cse14 1) (+ v_~next~0_36 .cse15)) (<= (+ c_~i~0 15 .cse16) .cse17) (< .cse17 (+ c_~i~0 12 .cse16)))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 15 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (+ (* v_~prev~0_37 3) v_~next~0_36)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51)))))) (< v_~cur~0_39 (+ (* 2 c_~cur~0) c_~prev~0)) (< v_~next~0_36 (+ c_~prev~0 (* 2 v_~cur~0_39) c_~cur~0)))) (< (+ (div (+ (- 1) c_~prev~0 .cse18) (- 2)) c_~j~0) .cse4) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~cur~0_39 (+ c_~prev~0 c_~cur~0)) (< v_~prev~0_37 (+ v_~cur~0_39 c_~cur~0)) (< v_~next~0_36 (+ (* 2 v_~cur~0_39) c_~cur~0)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse20 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse19 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse19) .cse20) (< .cse20 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse19))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse22 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse21 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse21) .cse22) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse22 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse21)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))))) (forall ((aux_div_v_~next~0_33_56 Int) (v_~cur~0_35 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< (+ aux_mod_v_~next~0_33_56 c_~j~0 9) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (< v_~cur~0_35 (+ c_~prev~0 c_~next~0)))) (<= 144 (+ (* 13 c_~cur~0) (* 21 c_~next~0))) (<= 144 (+ .cse23 (* 21 c_~prev~0))) (<= (div (+ (- 7) c_~prev~0 .cse0 c_~cur~0) (- 2)) .cse24) (= (+ (- 1) c_~j~0) 0) (<= 144 (+ .cse25 (* 34 c_~cur~0))) (<= 144 (+ .cse25 .cse3)) (<= (+ (div (+ .cse18 c_~next~0 (- 5)) (- 2)) c_~j~0) .cse1) (< c_~j~0 .cse26) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse28 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse27 (+ (* 3 c_~prev~0) c_~next~0))) (or (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 5 c_~prev~0) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 2 c_~next~0)) 4) (* 2 aux_div_v_~cur~0_35_51))) (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (< .cse27 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse28)) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse28) .cse27)))) (forall ((v_~cur~0_35 Int)) (or (< v_~cur~0_35 (+ c_~prev~0 c_~cur~0)) (and (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< (+ aux_mod_v_~next~0_33_56 c_~j~0 9) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))))) (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (< (+ aux_mod_v_~next~0_33_56 9 c_~i~0) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_56) c_~cur~0)) (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2)))))))) (<= c_~j~0 1) (forall ((aux_div_v_~next~0_33_56 Int) (v_~cur~0_35 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< v_~cur~0_35 (+ c_~prev~0 c_~next~0)) (< (+ aux_mod_v_~next~0_33_56 9 c_~i~0) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2))))) (<= 144 (+ .cse23 (* 21 c_~cur~0))) (<= (+ 2 c_~cur~0) c_~next~0) (< .cse29 .cse2) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse31 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse30 (+ (* 3 c_~prev~0) c_~next~0))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 5 c_~prev~0) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 2 c_~next~0)) 4) (* 2 aux_div_v_~cur~0_35_51))) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< .cse30 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse31)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse31) .cse30)))) (<= (+ (div (+ (- 7) c_~prev~0 .cse18 c_~cur~0) (- 2)) c_~j~0) .cse24) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~prev~0_37 (+ c_~prev~0 v_~cur~0_39 c_~cur~0)) (< v_~cur~0_39 (+ (* 2 c_~cur~0) c_~prev~0)) (and (forall ((aux_div_v_~j~0_10_159 Int) (aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (or (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 aux_div_v_~j~0_10_159 (* 2 aux_div_v_~cur~0_35_51))) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= (+ 16 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (+ (* v_~prev~0_37 3) v_~next~0_36)) (<= (+ (* aux_div_v_~j~0_10_159 2) 1) (+ v_~next~0_36 (div (+ (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (- 5) (* 5 v_~prev~0_37)) 2))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 15 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (+ (* v_~prev~0_37 3) v_~next~0_36)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51)))))) (< v_~next~0_36 (+ c_~prev~0 (* 2 v_~cur~0_39) c_~cur~0)))) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~prev~0_37 (+ c_~prev~0 v_~cur~0_39 c_~cur~0)) (< v_~cur~0_39 (+ (* 2 c_~cur~0) c_~prev~0)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse33 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse32 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse32) .cse33) (< .cse33 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse32))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse35 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse34 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse34) .cse35) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse35 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse34)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))) (< v_~next~0_36 (+ c_~prev~0 (* 2 v_~cur~0_39) c_~cur~0)))) (< .cse29 .cse26) (<= c_~i~0 1)))) is different from false Received shutdown request... [2022-02-19 17:21:46,772 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-19 17:21:46,772 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-19 17:21:46,794 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-19 17:21:47,815 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-19 17:21:47,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-02-19 17:21:47,973 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-02-19 17:21:48,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-19 17:21:48,067 WARN L594 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-02-19 17:21:48,069 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-19 17:21:48,069 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-02-19 17:21:48,070 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-02-19 17:21:48,075 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-02-19 17:21:48,077 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-19 17:21:48,077 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-19 17:21:48,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-02-19 17:21:48,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.02 05:21:48 BasicIcfg [2022-02-19 17:21:48,091 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-19 17:21:48,091 INFO L158 Benchmark]: Toolchain (without parser) took 872378.11ms. Allocated memory was 175.1MB in the beginning and 407.9MB in the end (delta: 232.8MB). Free memory was 119.8MB in the beginning and 172.0MB in the end (delta: -52.1MB). Peak memory consumption was 181.9MB. Max. memory is 8.0GB. [2022-02-19 17:21:48,091 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 175.1MB. Free memory was 137.4MB in the beginning and 137.4MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-19 17:21:48,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.40ms. Allocated memory was 175.1MB in the beginning and 254.8MB in the end (delta: 79.7MB). Free memory was 119.6MB in the beginning and 217.9MB in the end (delta: -98.2MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. [2022-02-19 17:21:48,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.72ms. Allocated memory is still 254.8MB. Free memory was 217.9MB in the beginning and 215.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-19 17:21:48,092 INFO L158 Benchmark]: Boogie Preprocessor took 28.73ms. Allocated memory is still 254.8MB. Free memory was 215.9MB in the beginning and 214.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-19 17:21:48,092 INFO L158 Benchmark]: RCFGBuilder took 259.27ms. Allocated memory is still 254.8MB. Free memory was 214.2MB in the beginning and 201.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-02-19 17:21:48,092 INFO L158 Benchmark]: TraceAbstraction took 871580.09ms. Allocated memory was 254.8MB in the beginning and 407.9MB in the end (delta: 153.1MB). Free memory was 201.2MB in the beginning and 172.0MB in the end (delta: 29.2MB). Peak memory consumption was 183.2MB. Max. memory is 8.0GB. [2022-02-19 17:21:48,093 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.10ms. Allocated memory is still 175.1MB. Free memory was 137.4MB in the beginning and 137.4MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 457.40ms. Allocated memory was 175.1MB in the beginning and 254.8MB in the end (delta: 79.7MB). Free memory was 119.6MB in the beginning and 217.9MB in the end (delta: -98.2MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.72ms. Allocated memory is still 254.8MB. Free memory was 217.9MB in the beginning and 215.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.73ms. Allocated memory is still 254.8MB. Free memory was 215.9MB in the beginning and 214.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 259.27ms. Allocated memory is still 254.8MB. Free memory was 214.2MB in the beginning and 201.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 871580.09ms. Allocated memory was 254.8MB in the beginning and 407.9MB in the end (delta: 153.1MB). Free memory was 201.2MB in the beginning and 172.0MB in the end (delta: 29.2MB). Peak memory consumption was 183.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - 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 executing Executor. - 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 executing Executor. - 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 executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 112 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 871.5s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 327.7s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 151, 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, 541.6s InterpolantComputationTime, 1597 NumberOfCodeBlocks, 1582 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2246 ConstructedInterpolants, 148 QuantifiedInterpolants, 29416 SizeOfPredicates, 104 NumberOfNonLiveVariables, 1433 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 2568/5288 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