/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-MCRwithoutDepranks-Lazy.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-4b0ab11 [2022-03-02 05:24:42,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-02 05:24:42,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-02 05:24:42,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-02 05:24:42,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-02 05:24:42,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-02 05:24:42,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-02 05:24:42,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-02 05:24:42,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-02 05:24:42,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-02 05:24:42,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-02 05:24:42,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-02 05:24:42,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-02 05:24:42,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-02 05:24:42,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-02 05:24:42,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-02 05:24:42,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-02 05:24:42,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-02 05:24:42,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-02 05:24:42,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-02 05:24:42,429 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-02 05:24:42,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-02 05:24:42,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-02 05:24:42,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-02 05:24:42,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-02 05:24:42,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-02 05:24:42,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-02 05:24:42,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-02 05:24:42,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-02 05:24:42,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-02 05:24:42,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-02 05:24:42,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-02 05:24:42,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-02 05:24:42,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-02 05:24:42,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-02 05:24:42,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-02 05:24:42,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-02 05:24:42,438 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-02 05:24:42,438 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-02 05:24:42,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-02 05:24:42,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-02 05:24:42,456 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-MCRwithoutDepranks-Lazy.epf [2022-03-02 05:24:42,480 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-02 05:24:42,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-02 05:24:42,482 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-02 05:24:42,482 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-02 05:24:42,483 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-02 05:24:42,483 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-02 05:24:42,483 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-02 05:24:42,483 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-02 05:24:42,483 INFO L138 SettingsManager]: * Use SBE=true [2022-03-02 05:24:42,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-02 05:24:42,484 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-02 05:24:42,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-02 05:24:42,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-02 05:24:42,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-02 05:24:42,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-02 05:24:42,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-02 05:24:42,485 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-02 05:24:42,485 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-02 05:24:42,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-02 05:24:42,485 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-02 05:24:42,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-02 05:24:42,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-02 05:24:42,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-02 05:24:42,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-02 05:24:42,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-02 05:24:42,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-02 05:24:42,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-02 05:24:42,486 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-03-02 05:24:42,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-02 05:24:42,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-02 05:24:42,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-02 05:24:42,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-02 05:24:42,486 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-02 05:24:42,486 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-03-02 05:24:42,486 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-02 05:24:42,487 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITHOUT_DEPRANKS [2022-03-02 05:24:42,487 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-03-02 05:24:42,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-02 05:24:42,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-02 05:24:42,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-02 05:24:42,684 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-02 05:24:42,685 INFO L275 PluginConnector]: CDTParser initialized [2022-03-02 05:24:42,686 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-03-02 05:24:42,754 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a9162012/c0d53cbfaed44ed3bf07467d85a82019/FLAG1a69fd685 [2022-03-02 05:24:43,210 INFO L306 CDTParser]: Found 1 translation units. [2022-03-02 05:24:43,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i [2022-03-02 05:24:43,225 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a9162012/c0d53cbfaed44ed3bf07467d85a82019/FLAG1a69fd685 [2022-03-02 05:24:43,235 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a9162012/c0d53cbfaed44ed3bf07467d85a82019 [2022-03-02 05:24:43,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-02 05:24:43,238 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-02 05:24:43,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-02 05:24:43,250 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-02 05:24:43,252 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-02 05:24:43,253 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.03 05:24:43" (1/1) ... [2022-03-02 05:24:43,253 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@281d8377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:24:43, skipping insertion in model container [2022-03-02 05:24:43,253 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.03 05:24:43" (1/1) ... [2022-03-02 05:24:43,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-02 05:24:43,277 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-02 05:24:43,520 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-03-02 05:24:43,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-02 05:24:43,532 INFO L203 MainTranslator]: Completed pre-run [2022-03-02 05:24:43,582 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-03-02 05:24:43,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-02 05:24:43,605 INFO L208 MainTranslator]: Completed translation [2022-03-02 05:24:43,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:24:43 WrapperNode [2022-03-02 05:24:43,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-02 05:24:43,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-02 05:24:43,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-02 05:24:43,606 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-02 05:24:43,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:24:43" (1/1) ... [2022-03-02 05:24:43,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:24:43" (1/1) ... [2022-03-02 05:24:43,648 INFO L137 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2022-03-02 05:24:43,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-02 05:24:43,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-02 05:24:43,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-02 05:24:43,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-02 05:24:43,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:24:43" (1/1) ... [2022-03-02 05:24:43,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:24:43" (1/1) ... [2022-03-02 05:24:43,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:24:43" (1/1) ... [2022-03-02 05:24:43,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:24:43" (1/1) ... [2022-03-02 05:24:43,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:24:43" (1/1) ... [2022-03-02 05:24:43,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:24:43" (1/1) ... [2022-03-02 05:24:43,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:24:43" (1/1) ... [2022-03-02 05:24:43,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-02 05:24:43,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-02 05:24:43,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-02 05:24:43,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-02 05:24:43,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:24:43" (1/1) ... [2022-03-02 05:24:43,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-02 05:24:43,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:24:43,714 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-03-02 05:24:43,719 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-03-02 05:24:43,741 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-03-02 05:24:43,741 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-03-02 05:24:43,741 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-03-02 05:24:43,741 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-03-02 05:24:43,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-02 05:24:43,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-02 05:24:43,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-02 05:24:43,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-02 05:24:43,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-02 05:24:43,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-02 05:24:43,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-02 05:24:43,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-02 05:24:43,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-02 05:24:43,743 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-02 05:24:43,852 INFO L234 CfgBuilder]: Building ICFG [2022-03-02 05:24:43,853 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-02 05:24:43,967 INFO L275 CfgBuilder]: Performing block encoding [2022-03-02 05:24:43,971 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-02 05:24:43,972 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-02 05:24:43,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.03 05:24:43 BoogieIcfgContainer [2022-03-02 05:24:43,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-02 05:24:43,974 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-02 05:24:43,974 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-02 05:24:43,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-02 05:24:43,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.03 05:24:43" (1/3) ... [2022-03-02 05:24:43,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39998415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.03 05:24:43, skipping insertion in model container [2022-03-02 05:24:43,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 05:24:43" (2/3) ... [2022-03-02 05:24:43,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39998415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.03 05:24:43, skipping insertion in model container [2022-03-02 05:24:43,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.03 05:24:43" (3/3) ... [2022-03-02 05:24:43,980 INFO L111 eAbstractionObserver]: Analyzing ICFG fib_unsafe-5.i [2022-03-02 05:24:43,984 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-02 05:24:43,984 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-02 05:24:43,984 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-02 05:24:43,984 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-02 05:24:44,006 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,006 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,006 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,006 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,007 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,007 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,007 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,007 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,007 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,008 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,008 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,008 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,008 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,008 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,008 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,008 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,009 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,009 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,009 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,009 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,009 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,009 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,009 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,010 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,010 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,010 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,010 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,010 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,010 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,010 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,011 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,011 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,011 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,011 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,011 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,012 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,014 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,014 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,014 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,014 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,014 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,016 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,017 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,017 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,017 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,017 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 05:24:44,017 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-02 05:24:44,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-03-02 05:24:44,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:24:44,050 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-03-02 05:24:44,058 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-03-02 05:24:44,093 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-02 05:24:44,098 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=true [2022-03-02 05:24:44,098 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-02 05:24:44,184 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 91 transitions and produced 92 states. [2022-03-02 05:24:44,186 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-02 05:24:44,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:24:44,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1927097680, now seen corresponding path program 1 times [2022-03-02 05:24:44,206 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:24:44,207 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979988199] [2022-03-02 05:24:44,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:24:44,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:24:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:24:44,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:24:44,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:24:44,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979988199] [2022-03-02 05:24:44,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979988199] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 05:24:44,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-02 05:24:44,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-02 05:24:44,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608610021] [2022-03-02 05:24:44,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 05:24:44,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-02 05:24:44,436 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:24:44,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-02 05:24:44,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-02 05:24:44,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:24:44,458 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:24:44,460 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-03-02 05:24:44,460 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:24:44,505 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 91 transitions and produced 92 states. [2022-03-02 05:24:44,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:24:44,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-02 05:24:44,507 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-02 05:24:44,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:24:44,510 INFO L85 PathProgramCache]: Analyzing trace with hash 560415153, now seen corresponding path program 1 times [2022-03-02 05:24:44,510 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:24:44,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38891839] [2022-03-02 05:24:44,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:24:44,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:24:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:24:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:24:44,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:24:44,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38891839] [2022-03-02 05:24:44,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38891839] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 05:24:44,654 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-02 05:24:44,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-02 05:24:44,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676631905] [2022-03-02 05:24:44,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 05:24:44,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-02 05:24:44,655 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:24:44,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-02 05:24:44,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-02 05:24:44,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:24:44,656 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:24:44,656 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-03-02 05:24:44,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:24:44,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:24:44,719 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 114 transitions and produced 115 states. [2022-03-02 05:24:44,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:24:44,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:24:44,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-02 05:24:44,720 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-02 05:24:44,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:24:44,721 INFO L85 PathProgramCache]: Analyzing trace with hash -951035470, now seen corresponding path program 1 times [2022-03-02 05:24:44,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:24:44,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669165273] [2022-03-02 05:24:44,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:24:44,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:24:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:24:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:24:44,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:24:44,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669165273] [2022-03-02 05:24:44,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669165273] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:24:44,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447456374] [2022-03-02 05:24:44,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:24:44,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:24:44,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:24:44,833 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-03-02 05:24:44,834 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-03-02 05:24:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:24:44,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-02 05:24:44,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:24:45,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:24:45,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 05:24:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:24:45,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447456374] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 05:24:45,195 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 05:24:45,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-02 05:24:45,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384183559] [2022-03-02 05:24:45,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 05:24:45,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-02 05:24:45,197 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:24:45,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-02 05:24:45,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-02 05:24:45,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:24:45,199 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:24:45,199 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-03-02 05:24:45,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:24:45,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:24:45,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:24:45,484 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 160 transitions and produced 159 states. [2022-03-02 05:24:45,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:24:45,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:24:45,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:24:45,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-02 05:24:45,705 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-03-02 05:24:45,705 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-02 05:24:45,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:24:45,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1666707666, now seen corresponding path program 2 times [2022-03-02 05:24:45,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:24:45,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657537157] [2022-03-02 05:24:45,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:24:45,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:24:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:24:45,807 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:24:45,808 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:24:45,808 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657537157] [2022-03-02 05:24:45,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657537157] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:24:45,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61741931] [2022-03-02 05:24:45,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-02 05:24:45,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:24:45,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:24:45,814 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-03-02 05:24:45,815 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-03-02 05:24:45,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-02 05:24:45,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 05:24:45,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-02 05:24:45,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:24:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:24:46,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 05:24:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:24:46,243 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61741931] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 05:24:46,243 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 05:24:46,243 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-02 05:24:46,243 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811757208] [2022-03-02 05:24:46,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 05:24:46,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-02 05:24:46,244 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:24:46,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-02 05:24:46,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-02 05:24:46,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:24:46,245 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:24:46,246 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-03-02 05:24:46,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:24:46,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:24:46,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:24:46,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:24:46,624 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 252 transitions and produced 244 states. [2022-03-02 05:24:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:24:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:24:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:24:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-02 05:24:46,656 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-03-02 05:24:46,843 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-03-02 05:24:46,843 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-02 05:24:46,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:24:46,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1283180782, now seen corresponding path program 3 times [2022-03-02 05:24:46,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:24:46,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39368737] [2022-03-02 05:24:46,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:24:46,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:24:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:24:47,049 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:24:47,049 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:24:47,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39368737] [2022-03-02 05:24:47,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39368737] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:24:47,049 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151954099] [2022-03-02 05:24:47,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-02 05:24:47,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:24:47,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:24:47,057 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-03-02 05:24:47,058 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-03-02 05:24:47,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-03-02 05:24:47,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 05:24:47,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-02 05:24:47,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:24:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:24:47,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 05:24:47,568 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:24:47,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151954099] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 05:24:47,568 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 05:24:47,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2022-03-02 05:24:47,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912979771] [2022-03-02 05:24:47,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 05:24:47,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-02 05:24:47,569 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:24:47,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-02 05:24:47,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2022-03-02 05:24:47,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:24:47,570 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:24:47,570 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-03-02 05:24:47,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:24:47,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:24:47,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:24:47,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-02 05:24:47,571 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:24:48,116 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 367 transitions and produced 350 states. [2022-03-02 05:24:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:24:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:24:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:24:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-02 05:24:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-02 05:24:48,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-02 05:24:48,331 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-03-02 05:24:48,332 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-02 05:24:48,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:24:48,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1938020081, now seen corresponding path program 4 times [2022-03-02 05:24:48,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:24:48,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250117408] [2022-03-02 05:24:48,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:24:48,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:24:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:24:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:24:49,667 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:24:49,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250117408] [2022-03-02 05:24:49,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250117408] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:24:49,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389751862] [2022-03-02 05:24:49,667 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-02 05:24:49,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:24:49,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:24:49,684 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-03-02 05:24:49,685 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-03-02 05:24:49,767 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-02 05:24:49,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 05:24:49,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-02 05:24:49,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:24:52,470 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 335 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:24:52,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 05:29:07,481 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 472 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:29:07,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389751862] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 05:29:07,481 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 05:29:07,482 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 121 [2022-03-02 05:29:07,482 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942184476] [2022-03-02 05:29:07,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 05:29:07,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2022-03-02 05:29:07,483 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:29:07,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2022-03-02 05:29:07,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=13522, Unknown=52, NotChecked=0, Total=14520 [2022-03-02 05:29:07,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:29:07,493 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:29:07,494 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-03-02 05:29:07,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:29:07,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:29:07,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:29:07,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-02 05:29:07,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-03-02 05:29:07,494 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:29:18,200 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-03-02 05:29:18,344 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 401 transitions and produced 385 states. [2022-03-02 05:29:18,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:29:18,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:29:18,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:29:18,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-02 05:29:18,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-02 05:29:18,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-02 05:29:18,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-02 05:29:18,551 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-03-02 05:29:18,552 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-02 05:29:18,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:29:18,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1765864314, now seen corresponding path program 1 times [2022-03-02 05:29:18,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:29:18,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739064992] [2022-03-02 05:29:18,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:29:18,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:29:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:29:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-03-02 05:29:18,584 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:29:18,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739064992] [2022-03-02 05:29:18,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739064992] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 05:29:18,584 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-02 05:29:18,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-02 05:29:18,584 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085413702] [2022-03-02 05:29:18,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 05:29:18,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-02 05:29:18,584 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:29:18,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-02 05:29:18,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-02 05:29:18,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:29:18,585 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:29:18,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-02 05:29:18,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:29:18,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:29:18,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:29:18,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-02 05:29:18,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-03-02 05:29:18,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-03-02 05:29:18,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:29:22,426 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-03-02 05:29:22,469 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 387 transitions and produced 371 states. [2022-03-02 05:29:22,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:29:22,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:29:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:29:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-02 05:29:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-02 05:29:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-02 05:29:22,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:29:22,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-02 05:29:22,473 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-02 05:29:22,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:29:22,473 INFO L85 PathProgramCache]: Analyzing trace with hash -820200619, now seen corresponding path program 1 times [2022-03-02 05:29:22,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:29:22,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966748773] [2022-03-02 05:29:22,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:29:22,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:29:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:29:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:29:24,315 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:29:24,315 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966748773] [2022-03-02 05:29:24,315 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966748773] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:29:24,316 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527543009] [2022-03-02 05:29:24,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:29:24,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:29:24,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:29:24,317 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-03-02 05:29:24,318 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-03-02 05:29:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:29:24,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2022-03-02 05:29:24,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:29:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 335 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:29:29,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 05:31:59,902 WARN L838 $PredicateComparison]: unable to prove that (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)) (< v_~next~0_36 (+ c_~prev~0 (* 2 v_~cur~0_39) c_~cur~0)) (and (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 ((.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) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse0) .cse1) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse1 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse0)) (<= 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_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse3 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse2 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse2 (+ c_~j~0 c_~i~0 12 .cse3 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse3 aux_mod_aux_mod_v_~next~0_33_71_104) .cse2))))))) is different from false [2022-03-02 05:33:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 23 not checked. [2022-03-02 05:33:10,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527543009] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 05:33:10,080 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 05:33:10,080 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 124 [2022-03-02 05:33:10,080 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688022288] [2022-03-02 05:33:10,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 05:33:10,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 124 states [2022-03-02 05:33:10,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:33:10,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2022-03-02 05:33:10,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=933, Invalid=14037, Unknown=40, NotChecked=242, Total=15252 [2022-03-02 05:33:10,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:33:10,086 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:33:10,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 124 states, 124 states have (on average 3.225806451612903) internal successors, (400), 124 states have internal predecessors, (400), 0 states have call successors, (0), 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-03-02 05:33:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:33:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:33:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:33:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-02 05:33:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-03-02 05:33:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-03-02 05:33:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:33:10,087 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:33:22,119 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~next~0 1)) (.cse4 (+ 2 c_~next~0 c_~cur~0)) (.cse0 (* (- 1) c_~j~0)) (.cse1 (* (- 1) c_~i~0)) (.cse3 (+ (* 2 c_~next~0) 4 c_~cur~0))) (and (= (+ (- 1) c_~i~0) 0) (<= (div (+ (- 3) .cse0 .cse1 c_~cur~0) (- 2)) .cse2) (<= (div (+ (- 9) .cse0 c_~next~0 c_~cur~0) (- 2)) .cse3) (forall ((aux_mod_v_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int) (v_~cur~0_35 Int)) (or (>= aux_mod_v_~next~0_33_71 2) (> 0 aux_mod_v_~next~0_33_71) (< (+ aux_mod_v_~next~0_33_71 c_~j~0 9 c_~i~0) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_71))) (<= (+ (* 5 aux_div_v_~next~0_33_71) v_~cur~0_35) (+ 22 (* aux_mod_v_~next~0_33_71 2) (* 2 c_~i~0) (* 2 c_~j~0))) (< v_~cur~0_35 (+ c_~next~0 c_~cur~0)))) (<= (div (+ .cse0 .cse1 c_~next~0 (- 5)) (- 2)) .cse4) (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_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse6 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse5 (+ (* v_~prev~0_37 3) 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_mod_aux_mod_v_~next~0_33_56_89) (< .cse5 (+ 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 (+ (* 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) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse6) .cse5)))) (forall ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse8 (+ (* v_~prev~0_37 3) c_~next~0)) (.cse7 (* 2 aux_div_aux_mod_v_~next~0_33_71_104))) (or (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (<= 0 (+ (div (+ (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 2 c_~next~0) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (<= (+ c_~j~0 14 c_~i~0 .cse7 aux_mod_aux_mod_v_~next~0_33_71_104) .cse8) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (< .cse8 (+ c_~j~0 c_~i~0 12 .cse7 aux_mod_aux_mod_v_~next~0_33_71_104)))))))) (forall ((v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~prev~0_37 c_~next~0) (and (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)))))) (forall ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse12 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse11 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse11 (+ c_~j~0 c_~i~0 12 .cse12 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse12 aux_mod_aux_mod_v_~next~0_33_71_104) .cse11))))) (< v_~next~0_36 (+ c_~next~0 c_~cur~0)))) (= (+ (- 1) c_~j~0) 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) (< (+ 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_~next~0 c_~cur~0)))) (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))) (< v_~cur~0_39 (+ c_~next~0 c_~cur~0)) (< v_~prev~0_37 (+ c_~next~0 v_~cur~0_39)) (and (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 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse13 (* 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 .cse13) .cse14) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse14 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse13)) (<= 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_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse16 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse15 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse15 (+ c_~j~0 c_~i~0 12 .cse16 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse16 aux_mod_aux_mod_v_~next~0_33_71_104) .cse15))))))) (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) (> 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_mod_v_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int)) (or (>= aux_mod_v_~next~0_33_71 2) (> 0 aux_mod_v_~next~0_33_71) (< (+ aux_mod_v_~next~0_33_71 c_~j~0 9 c_~i~0) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_71) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_33_71) v_~cur~0_35) (+ 22 (* aux_mod_v_~next~0_33_71 2) (* 2 c_~i~0) (* 2 c_~j~0)))))))) (<= 1 c_~next~0) (<= (div (+ (- 3) .cse0 c_~cur~0) (- 2)) .cse2) (<= (div (+ .cse0 c_~next~0 (- 5)) (- 2)) .cse4) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~prev~0_37 (+ v_~cur~0_39 c_~cur~0)) (< v_~next~0_36 (+ (* 2 v_~cur~0_39) c_~cur~0)) (not (<= c_~next~0 v_~cur~0_39)) (and (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 ((.cse18 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse17 (* 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 .cse17) .cse18) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse18 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse17)) (<= 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_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse20 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse19 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse19 (+ c_~j~0 c_~i~0 12 .cse20 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse20 aux_mod_aux_mod_v_~next~0_33_71_104) .cse19))))))) (= (+ (- 1) c_~prev~0) 0) (<= 1 c_~cur~0) (<= (div (+ (- 9) .cse0 .cse1 c_~next~0 c_~cur~0) (- 2)) .cse3))) is different from false [2022-03-02 05:37:14,290 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~next~0 c_~cur~0)) (.cse13 (* c_~next~0 55)) (.cse3 (* c_~prev~0 34)) (.cse2 (+ c_~next~0 1)) (.cse11 (* c_~next~0 34)) (.cse5 (+ 2 c_~next~0 c_~cur~0)) (.cse12 (* 21 c_~prev~0)) (.cse14 (* 34 c_~cur~0)) (.cse0 (* (- 1) c_~j~0)) (.cse1 (* (- 1) c_~i~0)) (.cse4 (+ (* 2 c_~next~0) 4 c_~cur~0))) (and (= (+ (- 1) c_~i~0) 0) (<= (div (+ (- 3) .cse0 .cse1 c_~cur~0) (- 2)) .cse2) (<= 144 (+ .cse3 (* 55 c_~cur~0))) (<= (div (+ (- 9) .cse0 c_~next~0 c_~cur~0) (- 2)) .cse4) (forall ((aux_mod_v_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int) (v_~cur~0_35 Int)) (or (>= aux_mod_v_~next~0_33_71 2) (> 0 aux_mod_v_~next~0_33_71) (< (+ aux_mod_v_~next~0_33_71 c_~j~0 9 c_~i~0) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_71))) (<= (+ (* 5 aux_div_v_~next~0_33_71) v_~cur~0_35) (+ 22 (* aux_mod_v_~next~0_33_71 2) (* 2 c_~i~0) (* 2 c_~j~0))) (< v_~cur~0_35 (+ c_~next~0 c_~cur~0)))) (<= (div (+ .cse0 .cse1 c_~next~0 (- 5)) (- 2)) .cse5) (< (+ c_~j~0 c_~i~0) .cse6) (<= 3 c_~cur~0) (<= 2 c_~prev~0) (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_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse8 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse7 (+ (* v_~prev~0_37 3) 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_mod_aux_mod_v_~next~0_33_56_89) (< .cse7 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse8)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 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) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse8) .cse7)))) (forall ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse10 (+ (* v_~prev~0_37 3) c_~next~0)) (.cse9 (* 2 aux_div_aux_mod_v_~next~0_33_71_104))) (or (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (<= 0 (+ (div (+ (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 2 c_~next~0) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (<= (+ c_~j~0 14 c_~i~0 .cse9 aux_mod_aux_mod_v_~next~0_33_71_104) .cse10) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (< .cse10 (+ c_~j~0 c_~i~0 12 .cse9 aux_mod_aux_mod_v_~next~0_33_71_104)))))))) (<= 144 (+ .cse11 .cse12)) (< c_~j~0 .cse6) (= (+ (- 1) c_~j~0) 0) (<= 144 (+ .cse13 .cse14)) (<= 144 (+ .cse13 .cse3)) (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_~next~0 c_~cur~0)))) (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))) (< v_~cur~0_39 (+ c_~next~0 c_~cur~0)) (< v_~prev~0_37 (+ c_~next~0 v_~cur~0_39)) (and (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 ((.cse16 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse15 (* 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 .cse15) .cse16) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse16 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse15)) (<= 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_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse18 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse17 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse17 (+ c_~j~0 c_~i~0 12 .cse18 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse18 aux_mod_aux_mod_v_~next~0_33_71_104) .cse17))))))) (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) (> 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_mod_v_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int)) (or (>= aux_mod_v_~next~0_33_71 2) (> 0 aux_mod_v_~next~0_33_71) (< (+ aux_mod_v_~next~0_33_71 c_~j~0 9 c_~i~0) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_71) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_33_71) v_~cur~0_35) (+ 22 (* aux_mod_v_~next~0_33_71 2) (* 2 c_~i~0) (* 2 c_~j~0)))))))) (<= c_~j~0 1) (<= (div (+ (- 3) .cse0 c_~cur~0) (- 2)) .cse2) (<= 144 (+ .cse11 (* 21 c_~cur~0))) (<= (div (+ .cse0 c_~next~0 (- 5)) (- 2)) .cse5) (<= 3 c_~next~0) (<= 144 (+ .cse12 .cse14)) (<= c_~i~0 1) (<= (div (+ (- 9) .cse0 .cse1 c_~next~0 c_~cur~0) (- 2)) .cse4))) is different from false [2022-03-02 05:38:33,503 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~next~0 13)) (.cse7 (* 21 c_~next~0)) (.cse10 (+ c_~next~0 c_~cur~0)) (.cse14 (* c_~next~0 55)) (.cse5 (* c_~prev~0 34)) (.cse0 (* c_~prev~0 8)) (.cse11 (* 13 c_~cur~0)) (.cse4 (+ c_~next~0 1)) (.cse6 (* c_~prev~0 13)) (.cse12 (* c_~next~0 34)) (.cse20 (* 21 c_~cur~0)) (.cse9 (+ 2 c_~next~0 c_~cur~0)) (.cse13 (* 21 c_~prev~0)) (.cse15 (* 34 c_~cur~0)) (.cse2 (* (- 1) c_~j~0)) (.cse3 (* (- 1) c_~i~0)) (.cse8 (+ (* 2 c_~next~0) 4 c_~cur~0))) (and (= (+ (- 1) c_~i~0) 0) (<= 144 (+ .cse0 .cse1)) (<= 144 (+ (* 8 c_~cur~0) .cse1)) (<= (div (+ (- 3) .cse2 .cse3 c_~cur~0) (- 2)) .cse4) (<= 144 (+ .cse5 (* 55 c_~cur~0))) (<= 144 (+ .cse6 .cse7)) (<= (div (+ (- 9) .cse2 c_~next~0 c_~cur~0) (- 2)) .cse8) (<= (div (+ .cse2 .cse3 c_~next~0 (- 5)) (- 2)) .cse9) (< (+ c_~j~0 c_~i~0) .cse10) (<= 144 (+ .cse11 .cse7)) (<= 144 (+ .cse12 .cse13)) (< c_~j~0 .cse10) (= (+ (- 1) c_~j~0) 0) (<= 144 (+ .cse14 .cse15)) (<= 144 (+ .cse14 .cse5)) (<= 144 (+ .cse0 .cse11)) (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))) (< v_~cur~0_39 (+ c_~next~0 c_~cur~0)) (< v_~prev~0_37 (+ c_~next~0 v_~cur~0_39)) (and (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 ((.cse17 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse16 (* 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 .cse16) .cse17) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse17 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse16)) (<= 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_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse19 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse18 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse18 (+ c_~j~0 c_~i~0 12 .cse19 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse19 aux_mod_aux_mod_v_~next~0_33_71_104) .cse18))))))) (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) (> 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_mod_v_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int)) (or (>= aux_mod_v_~next~0_33_71 2) (> 0 aux_mod_v_~next~0_33_71) (< (+ aux_mod_v_~next~0_33_71 c_~j~0 9 c_~i~0) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_71) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_33_71) v_~cur~0_35) (+ 22 (* aux_mod_v_~next~0_33_71 2) (* 2 c_~i~0) (* 2 c_~j~0)))))))) (<= c_~j~0 1) (<= (div (+ (- 3) .cse2 c_~cur~0) (- 2)) .cse4) (<= 144 (+ .cse20 .cse6)) (<= 144 (+ .cse12 .cse20)) (<= (div (+ .cse2 c_~next~0 (- 5)) (- 2)) .cse9) (<= 8 c_~next~0) (<= 8 c_~cur~0) (<= 144 (+ .cse13 .cse15)) (<= c_~i~0 1) (<= 5 c_~prev~0) (<= (div (+ (- 9) .cse2 .cse3 c_~next~0 c_~cur~0) (- 2)) .cse8))) is different from false [2022-03-02 05:39:03,181 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse61 (* 2 c_~cur~0)) (.cse9 (* (- 1) c_~j~0)) (.cse50 (* (- 1) c_~i~0))) (let ((.cse4 (div (+ (- 3) .cse9 .cse50 c_~cur~0) (- 2))) (.cse19 (+ c_~next~0 c_~cur~0)) (.cse32 (+ .cse61 3 c_~prev~0)) (.cse12 (div (+ .cse9 .cse50 c_~next~0 (- 5)) (- 2))) (.cse7 (+ 2 c_~prev~0 c_~next~0)) (.cse8 (+ c_~prev~0 c_~next~0)) (.cse48 (+ c_~prev~0 c_~cur~0)) (.cse6 (div (+ .cse9 c_~next~0 (- 5)) (- 2))) (.cse13 (+ 2 c_~next~0 c_~cur~0)) (.cse49 (div (+ (- 3) .cse9 c_~cur~0) (- 2))) (.cse11 (+ c_~prev~0 1 c_~cur~0)) (.cse5 (+ c_~next~0 1)) (.cse18 (+ c_~j~0 c_~i~0)) (.cse41 (+ .cse61 c_~prev~0)) (.cse10 (+ (* 2 c_~next~0) 4 c_~cur~0))) (and (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_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_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) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse0) .cse1) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse1 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse0)) (<= 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_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse3 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse2 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse2 (+ c_~j~0 c_~i~0 12 .cse3 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse3 aux_mod_aux_mod_v_~next~0_33_71_104) .cse2))))))) (forall ((aux_div_v_~cur~0_34_71 Int) (aux_mod_v_~cur~0_34_71 Int)) (or (not (<= (+ (* 2 aux_div_v_~cur~0_34_71) c_~prev~0 c_~next~0) (+ 7 c_~j~0 c_~i~0 aux_mod_v_~cur~0_34_71))) (<= (+ c_~prev~0 (* 5 aux_div_v_~cur~0_34_71)) (+ (* 2 aux_mod_v_~cur~0_34_71) (* 2 c_~i~0) (* 2 c_~j~0) 17)) (>= aux_mod_v_~cur~0_34_71 2) (> 0 aux_mod_v_~cur~0_34_71))) (<= 144 |c_ULTIMATE.start_main_~correct~0#1|) (<= .cse4 .cse5) (<= .cse6 .cse7) (< c_~j~0 .cse8) (< (div (+ (- 1) c_~prev~0 .cse9) (- 2)) .cse5) (<= (div (+ (- 9) .cse9 c_~next~0 c_~cur~0) (- 2)) .cse10) (<= .cse4 .cse11) (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)) (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))))) (forall ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= (+ c_~i~0 15 (* 2 aux_div_aux_mod_v_~next~0_33_71_104) aux_mod_aux_mod_v_~next~0_33_71_104) (+ (* v_~prev~0_37 3) v_~next~0_36)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104)))) (< v_~next~0_36 (+ c_~prev~0 (* 2 v_~cur~0_39) c_~cur~0)))) (forall ((aux_mod_v_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int) (v_~cur~0_35 Int)) (or (>= aux_mod_v_~next~0_33_71 2) (> 0 aux_mod_v_~next~0_33_71) (< (+ aux_mod_v_~next~0_33_71 c_~j~0 9 c_~i~0) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_71))) (<= (+ (* 5 aux_div_v_~next~0_33_71) v_~cur~0_35) (+ 22 (* aux_mod_v_~next~0_33_71 2) (* 2 c_~i~0) (* 2 c_~j~0))) (< v_~cur~0_35 (+ c_~next~0 c_~cur~0)))) (<= (+ 143 c_~i~0) (+ |c_ULTIMATE.start_main_~correct~0#1| c_~j~0)) (<= .cse12 .cse13) (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_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~next~0_36 (+ (* 2 c_~cur~0) c_~prev~0)) (< v_~prev~0_37 (+ c_~prev~0 c_~cur~0)) (and (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 ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse17 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse16 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse16 (+ c_~j~0 c_~i~0 12 .cse17 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse17 aux_mod_aux_mod_v_~next~0_33_71_104) .cse16))))))) (< .cse18 .cse19) (forall ((v_~cur~0_39 Int)) (or (forall ((v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~next~0_36 (+ c_~prev~0 (* 2 v_~cur~0_39))) (< v_~prev~0_37 (+ c_~prev~0 v_~cur~0_39)) (and (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 ((.cse21 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse20 (* 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 .cse20) .cse21) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse21 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse20)) (<= 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_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse23 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse22 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse22 (+ c_~j~0 c_~i~0 12 .cse23 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse23 aux_mod_aux_mod_v_~next~0_33_71_104) .cse22))))))) (not (<= c_~next~0 v_~cur~0_39)))) (<= c_~i~0 (+ c_~j~0 1)) (< .cse18 c_~prev~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) (< (+ 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)))) (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_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse25 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse24 (+ (* v_~prev~0_37 3) 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_mod_aux_mod_v_~next~0_33_56_89) (< .cse24 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse25)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 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) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse25) .cse24)))) (forall ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse27 (+ (* v_~prev~0_37 3) c_~next~0)) (.cse26 (* 2 aux_div_aux_mod_v_~next~0_33_71_104))) (or (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (<= 0 (+ (div (+ (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 2 c_~next~0) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (<= (+ c_~j~0 14 c_~i~0 .cse26 aux_mod_aux_mod_v_~next~0_33_71_104) .cse27) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (< .cse27 (+ c_~j~0 c_~i~0 12 .cse26 aux_mod_aux_mod_v_~next~0_33_71_104)))))))) (< .cse18 |c_ULTIMATE.start_fib_#res#1|) (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))) (< v_~cur~0_39 (+ c_~prev~0 c_~next~0)) (< v_~prev~0_37 (+ c_~next~0 v_~cur~0_39)) (and (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 ((.cse29 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse28 (* 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 .cse28) .cse29) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse29 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse28)) (<= 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_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse31 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse30 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse30 (+ c_~j~0 c_~i~0 12 .cse31 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse31 aux_mod_aux_mod_v_~next~0_33_71_104) .cse30))))))) (forall ((aux_mod_v_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int)) (or (>= aux_mod_v_~next~0_33_71 2) (<= (+ (* 5 aux_div_v_~next~0_33_71) c_~cur~0) (+ 22 (* aux_mod_v_~next~0_33_71 2) (* 2 c_~i~0) (* 2 c_~j~0))) (> 0 aux_mod_v_~next~0_33_71) (not (<= (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~next~0_33_71)) (+ aux_mod_v_~next~0_33_71 c_~j~0 9 c_~i~0))))) (<= (div (+ (- 7) c_~prev~0 .cse9 c_~cur~0) (- 2)) .cse32) (forall ((v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~prev~0_37 c_~next~0) (and (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 ((.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) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse33) .cse34) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse34 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse33)) (<= 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_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse36 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse35 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse35 (+ c_~j~0 c_~i~0 12 .cse36 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse36 aux_mod_aux_mod_v_~next~0_33_71_104) .cse35))))) (< v_~next~0_36 (+ c_~next~0 c_~cur~0)))) (< c_~j~0 .cse19) (= (+ (- 1) c_~j~0) 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) (< (+ 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_~next~0 c_~cur~0)))) (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))) (< v_~cur~0_39 (+ c_~next~0 c_~cur~0)) (< v_~prev~0_37 (+ c_~next~0 v_~cur~0_39)) (and (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 ((.cse38 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse37 (* 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 .cse37) .cse38) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse38 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse37)) (<= 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_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse40 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse39 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse39 (+ c_~j~0 c_~i~0 12 .cse40 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse40 aux_mod_aux_mod_v_~next~0_33_71_104) .cse39))))))) (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) (> 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_mod_v_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int)) (or (>= aux_mod_v_~next~0_33_71 2) (> 0 aux_mod_v_~next~0_33_71) (< (+ aux_mod_v_~next~0_33_71 c_~j~0 9 c_~i~0) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_71) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_33_71) v_~cur~0_35) (+ 22 (* aux_mod_v_~next~0_33_71 2) (* 2 c_~i~0) (* 2 c_~j~0)))))))) (< .cse18 c_~cur~0) (< c_~j~0 .cse41) (forall ((aux_mod_v_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int) (v_~cur~0_35 Int)) (or (>= aux_mod_v_~next~0_33_71 2) (> 0 aux_mod_v_~next~0_33_71) (<= (+ (* 5 aux_div_v_~next~0_33_71) v_~cur~0_35) (+ 22 (* aux_mod_v_~next~0_33_71 2) (* 2 c_~i~0) (* 2 c_~j~0))) (< (+ aux_mod_v_~next~0_33_71 c_~j~0 9 c_~i~0) (+ (* 2 v_~cur~0_35) c_~prev~0 (* 2 aux_div_v_~next~0_33_71) c_~cur~0)) (< v_~cur~0_35 (+ (* 2 c_~cur~0) c_~prev~0)))) (forall ((v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~next~0_36 (+ c_~prev~0 c_~next~0)) (< v_~prev~0_37 c_~next~0) (and (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 ((.cse43 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse42 (* 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 .cse42) .cse43) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse43 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse42)) (<= 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_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse45 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse44 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse44 (+ c_~j~0 c_~i~0 12 .cse45 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse45 aux_mod_aux_mod_v_~next~0_33_71_104) .cse44))))))) (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 ((.cse47 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse46 (+ (* 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) (< .cse46 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse47)) (< 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 .cse47) .cse46)))) (forall ((aux_mod_v_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int) (v_~cur~0_35 Int)) (or (>= aux_mod_v_~next~0_33_71 2) (> 0 aux_mod_v_~next~0_33_71) (< v_~cur~0_35 (+ c_~prev~0 c_~next~0)) (< (+ aux_mod_v_~next~0_33_71 c_~j~0 9 c_~i~0) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_71))) (<= (+ (* 5 aux_div_v_~next~0_33_71) v_~cur~0_35) (+ 22 (* aux_mod_v_~next~0_33_71 2) (* 2 c_~i~0) (* 2 c_~j~0))))) (<= c_~j~0 1) (< c_~j~0 .cse48) (<= .cse49 .cse5) (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_mod_v_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int)) (or (>= aux_mod_v_~next~0_33_71 2) (> 0 aux_mod_v_~next~0_33_71) (< (+ aux_mod_v_~next~0_33_71 c_~j~0 9 c_~i~0) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_71) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_33_71) v_~cur~0_35) (+ 22 (* aux_mod_v_~next~0_33_71 2) (* 2 c_~i~0) (* 2 c_~j~0)))))))) (< c_~j~0 |c_ULTIMATE.start_fib_#res#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) (<= (+ (* 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))) (< (+ aux_mod_v_~next~0_33_56 c_~j~0 9) (+ (* 2 v_~cur~0_35) c_~prev~0 (* 2 aux_div_v_~next~0_33_56) c_~cur~0)) (< v_~cur~0_35 (+ (* 2 c_~cur~0) c_~prev~0)))) (<= (div (+ (- 7) c_~prev~0 .cse9 .cse50 c_~cur~0) (- 2)) .cse32) (<= 0 c_~prev~0) (< c_~j~0 c_~cur~0) (<= .cse12 .cse7) (< .cse18 c_~next~0) (< .cse18 .cse8) (< .cse18 .cse48) (< c_~j~0 c_~prev~0) (<= .cse6 .cse13) (<= .cse49 .cse11) (< (div (+ (- 1) c_~prev~0 .cse9 .cse50) (- 2)) .cse5) (forall ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse52 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse51 (+ (* 3 c_~prev~0) c_~next~0))) (or (<= 0 (+ (div (+ (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 c_~prev~0) (* 2 c_~next~0)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (< .cse51 (+ c_~j~0 c_~i~0 12 .cse52 aux_mod_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse52 aux_mod_aux_mod_v_~next~0_33_71_104) .cse51)))) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~prev~0_37 (+ v_~cur~0_39 c_~cur~0)) (< v_~next~0_36 (+ (* 2 v_~cur~0_39) c_~cur~0)) (not (<= c_~next~0 v_~cur~0_39)) (and (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 ((.cse54 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse53 (* 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 .cse53) .cse54) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse54 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse53)) (<= 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_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse56 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse55 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse55 (+ c_~j~0 c_~i~0 12 .cse56 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse56 aux_mod_aux_mod_v_~next~0_33_71_104) .cse55))))))) (< .cse18 .cse41) (forall ((v_~cur~0_35 Int)) (or (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) (<= (+ (* 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_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int)) (or (>= aux_mod_v_~next~0_33_71 2) (> 0 aux_mod_v_~next~0_33_71) (not (<= (+ (* 2 v_~cur~0_35) c_~prev~0 (* 2 aux_div_v_~next~0_33_71)) (+ aux_mod_v_~next~0_33_71 c_~j~0 9 c_~i~0))) (<= (+ (* 5 aux_div_v_~next~0_33_71) v_~cur~0_35) (+ 22 (* aux_mod_v_~next~0_33_71 2) (* 2 c_~i~0) (* 2 c_~j~0)))))) (not (<= c_~next~0 v_~cur~0_35)))) (< c_~j~0 c_~next~0) (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) c_~cur~0) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (not (<= (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~next~0_33_56)) (+ aux_mod_v_~next~0_33_56 c_~j~0 9))))) (forall ((v_~next~0_36 Int)) (or (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_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse58 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse57 (* 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 .cse57) .cse58) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse58 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse57)) (<= 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_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse60 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse59 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse59 (+ c_~j~0 c_~i~0 12 .cse60 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse60 aux_mod_aux_mod_v_~next~0_33_71_104) .cse59))))))) (not (<= (+ c_~prev~0 c_~cur~0) v_~next~0_36)))) (<= 1 c_~cur~0) (<= (div (+ (- 9) .cse9 .cse50 c_~next~0 c_~cur~0) (- 2)) .cse10)))) is different from false [2022-03-02 05:39:03,860 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 448 transitions and produced 432 states. [2022-03-02 05:39:03,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:03,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:03,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:39:03,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-02 05:39:03,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-02 05:39:03,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-02 05:39:03,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:03,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-02 05:39:03,879 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-03-02 05:39:04,061 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-03-02 05:39:04,062 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-02 05:39:04,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:39:04,062 INFO L85 PathProgramCache]: Analyzing trace with hash -434936109, now seen corresponding path program 1 times [2022-03-02 05:39:04,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:39:04,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225346568] [2022-03-02 05:39:04,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:39:04,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:39:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:39:04,119 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2022-03-02 05:39:04,119 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:39:04,119 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225346568] [2022-03-02 05:39:04,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225346568] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:39:04,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052367263] [2022-03-02 05:39:04,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:39:04,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:39:04,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:39:04,121 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-03-02 05:39:04,122 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-03-02 05:39:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:39:04,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-02 05:39:04,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:39:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2022-03-02 05:39:04,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 05:39:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2022-03-02 05:39:04,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052367263] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 05:39:04,621 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 05:39:04,621 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-02 05:39:04,622 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392838369] [2022-03-02 05:39:04,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 05:39:04,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-02 05:39:04,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:39:04,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-02 05:39:04,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-02 05:39:04,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:04,623 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:39:04,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 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-03-02 05:39:04,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:04,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:04,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:39:04,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-02 05:39:04,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-03-02 05:39:04,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-03-02 05:39:04,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:04,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2022-03-02 05:39:04,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:05,121 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 448 transitions and produced 428 states. [2022-03-02 05:39:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:39:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-02 05:39:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-02 05:39:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-02 05:39:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-02 05:39:05,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:39:05,139 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-03-02 05:39:05,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:39:05,329 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-02 05:39:05,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:39:05,329 INFO L85 PathProgramCache]: Analyzing trace with hash -940582221, now seen corresponding path program 1 times [2022-03-02 05:39:05,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:39:05,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303782611] [2022-03-02 05:39:05,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:39:05,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:39:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:39:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-03-02 05:39:05,436 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:39:05,436 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303782611] [2022-03-02 05:39:05,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303782611] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:39:05,436 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806937441] [2022-03-02 05:39:05,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:39:05,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:39:05,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:39:05,437 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-02 05:39:05,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-02 05:39:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:39:05,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-02 05:39:05,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 05:39:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-03-02 05:39:05,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 05:39:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-03-02 05:39:05,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806937441] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 05:39:05,967 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 05:39:05,967 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-02 05:39:05,967 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116074812] [2022-03-02 05:39:05,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 05:39:05,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-02 05:39:05,968 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 05:39:05,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-02 05:39:05,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-03-02 05:39:05,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:05,968 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 05:39:05,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 0 states have call successors, (0), 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-03-02 05:39:05,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:05,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:05,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:39:05,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-02 05:39:05,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-03-02 05:39:05,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-03-02 05:39:05,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:05,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2022-03-02 05:39:05,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:39:05,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:06,460 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 432 transitions and produced 411 states. [2022-03-02 05:39:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 05:39:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:39:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-02 05:39:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-02 05:39:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-02 05:39:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 05:39:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-03-02 05:39:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 05:39:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-02 05:39:06,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-02 05:39:06,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-02 05:39:06,667 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-02 05:39:06,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 05:39:06,668 INFO L85 PathProgramCache]: Analyzing trace with hash -361204730, now seen corresponding path program 1 times [2022-03-02 05:39:06,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 05:39:06,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329042918] [2022-03-02 05:39:06,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:39:06,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 05:39:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:39:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 05:39:08,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 05:39:08,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329042918] [2022-03-02 05:39:08,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329042918] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 05:39:08,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018866039] [2022-03-02 05:39:08,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 05:39:08,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:39:08,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 05:39:08,835 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-02 05:39:08,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-02 05:39:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 05:39:08,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 45 conjunts are in the unsatisfiable core [2022-03-02 05:39:08,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2022-03-02 05:39:13,864 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-03-02 05:39:13,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-02 05:39:13,883 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-03-02 05:39:13,893 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-02 05:39:13,899 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-03-02 05:39:14,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 05:39:14,065 WARN L594 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 157 with TraceHistMax 12,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. [2022-03-02 05:39:14,067 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-02 05:39:14,068 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-02 05:39:14,072 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2022-03-02 05:39:14,074 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-02 05:39:14,074 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-02 05:39:14,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.03 05:39:14 BasicIcfg [2022-03-02 05:39:14,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-02 05:39:14,076 INFO L158 Benchmark]: Toolchain (without parser) took 870837.64ms. Allocated memory was 209.7MB in the beginning and 548.4MB in the end (delta: 338.7MB). Free memory was 152.8MB in the beginning and 278.3MB in the end (delta: -125.5MB). Peak memory consumption was 214.2MB. Max. memory is 8.0GB. [2022-03-02 05:39:14,076 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 209.7MB. Free memory is still 170.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-02 05:39:14,076 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.97ms. Allocated memory is still 209.7MB. Free memory was 183.1MB in the beginning and 172.7MB in the end (delta: 10.4MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. [2022-03-02 05:39:14,076 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.91ms. Allocated memory is still 209.7MB. Free memory was 172.7MB in the beginning and 170.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-02 05:39:14,077 INFO L158 Benchmark]: Boogie Preprocessor took 26.75ms. Allocated memory is still 209.7MB. Free memory was 170.6MB in the beginning and 169.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-02 05:39:14,077 INFO L158 Benchmark]: RCFGBuilder took 283.58ms. Allocated memory is still 209.7MB. Free memory was 169.1MB in the beginning and 156.9MB in the end (delta: 12.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-02 05:39:14,077 INFO L158 Benchmark]: TraceAbstraction took 870101.02ms. Allocated memory was 209.7MB in the beginning and 548.4MB in the end (delta: 338.7MB). Free memory was 156.2MB in the beginning and 278.3MB in the end (delta: -122.0MB). Peak memory consumption was 217.3MB. Max. memory is 8.0GB. [2022-03-02 05:39:14,078 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.09ms. Allocated memory is still 209.7MB. Free memory is still 170.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 355.97ms. Allocated memory is still 209.7MB. Free memory was 183.1MB in the beginning and 172.7MB in the end (delta: 10.4MB). Peak memory consumption was 13.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.91ms. Allocated memory is still 209.7MB. Free memory was 172.7MB in the beginning and 170.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.75ms. Allocated memory is still 209.7MB. Free memory was 170.6MB in the beginning and 169.5MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 283.58ms. Allocated memory is still 209.7MB. Free memory was 169.1MB in the beginning and 156.9MB in the end (delta: 12.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 870101.02ms. Allocated memory was 209.7MB in the beginning and 548.4MB in the end (delta: 338.7MB). Free memory was 156.2MB in the beginning and 278.3MB in the end (delta: -122.0MB). Peak memory consumption was 217.3MB. 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 PartialOrderCegarLoop was analyzing trace of length 157 with TraceHistMax 12,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 157 with TraceHistMax 12,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 157 with TraceHistMax 12,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 112 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 870.0s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 370.9s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 201, 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.4s SatisfiabilityAnalysisTime, 489.0s InterpolantComputationTime, 1930 NumberOfCodeBlocks, 1915 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2744 ConstructedInterpolants, 148 QuantifiedInterpolants, 29867 SizeOfPredicates, 110 NumberOfNonLiveVariables, 1774 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 4015/6783 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