/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-Lazy-NoForkJoinOpt-wrwc.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_safe-5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 18:59:46,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 18:59:46,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 18:59:46,340 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 18:59:46,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 18:59:46,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 18:59:46,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 18:59:46,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 18:59:46,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 18:59:46,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 18:59:46,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 18:59:46,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 18:59:46,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 18:59:46,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 18:59:46,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 18:59:46,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 18:59:46,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 18:59:46,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 18:59:46,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 18:59:46,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 18:59:46,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 18:59:46,367 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 18:59:46,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 18:59:46,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 18:59:46,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 18:59:46,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 18:59:46,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 18:59:46,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 18:59:46,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 18:59:46,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 18:59:46,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 18:59:46,375 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 18:59:46,376 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 18:59:46,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 18:59:46,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 18:59:46,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 18:59:46,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 18:59:46,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 18:59:46,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 18:59:46,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 18:59:46,378 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 18:59:46,382 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-Lazy-NoForkJoinOpt-wrwc.epf [2022-03-01 18:59:46,402 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 18:59:46,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 18:59:46,403 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 18:59:46,403 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 18:59:46,403 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 18:59:46,404 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 18:59:46,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 18:59:46,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 18:59:46,404 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 18:59:46,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 18:59:46,404 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 18:59:46,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 18:59:46,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 18:59:46,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 18:59:46,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 18:59:46,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 18:59:46,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 18:59:46,405 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 18:59:46,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 18:59:46,405 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 18:59:46,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 18:59:46,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 18:59:46,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 18:59:46,405 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 18:59:46,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 18:59:46,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 18:59:46,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 18:59:46,406 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-03-01 18:59:46,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 18:59:46,406 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 18:59:46,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 18:59:46,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 18:59:46,406 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 18:59:46,406 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-03-01 18:59:46,406 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 18:59:46,406 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-03-01 18:59:46,407 INFO L138 SettingsManager]: * MCR: Overapproximate write-read-write conflicts=false [2022-03-01 18:59:46,407 INFO L138 SettingsManager]: * MCR: Optimize fork and join=false [2022-03-01 18:59:46,407 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-01 18:59:46,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 18:59:46,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 18:59:46,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 18:59:46,609 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 18:59:46,620 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 18:59:46,622 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_safe-5.i [2022-03-01 18:59:46,679 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f02e7c23/d6e52647cde4445e80990dc78a05c715/FLAGdb689168e [2022-03-01 18:59:47,153 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 18:59:47,153 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-5.i [2022-03-01 18:59:47,171 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f02e7c23/d6e52647cde4445e80990dc78a05c715/FLAGdb689168e [2022-03-01 18:59:47,478 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f02e7c23/d6e52647cde4445e80990dc78a05c715 [2022-03-01 18:59:47,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 18:59:47,481 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 18:59:47,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 18:59:47,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 18:59:47,484 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 18:59:47,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 06:59:47" (1/1) ... [2022-03-01 18:59:47,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794220f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 06:59:47, skipping insertion in model container [2022-03-01 18:59:47,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 06:59:47" (1/1) ... [2022-03-01 18:59:47,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 18:59:47,512 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 18:59:47,790 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-5.i[30813,30826] [2022-03-01 18:59:47,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 18:59:47,799 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 18:59:47,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-5.i[30813,30826] [2022-03-01 18:59:47,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 18:59:47,870 INFO L208 MainTranslator]: Completed translation [2022-03-01 18:59:47,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 06:59:47 WrapperNode [2022-03-01 18:59:47,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 18:59:47,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 18:59:47,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 18:59:47,872 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 18:59:47,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 06:59:47" (1/1) ... [2022-03-01 18:59:47,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 06:59:47" (1/1) ... [2022-03-01 18:59:47,909 INFO L137 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2022-03-01 18:59:47,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 18:59:47,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 18:59:47,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 18:59:47,910 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 18:59:47,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 06:59:47" (1/1) ... [2022-03-01 18:59:47,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 06:59:47" (1/1) ... [2022-03-01 18:59:47,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 06:59:47" (1/1) ... [2022-03-01 18:59:47,919 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 06:59:47" (1/1) ... [2022-03-01 18:59:47,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 06:59:47" (1/1) ... [2022-03-01 18:59:47,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 06:59:47" (1/1) ... [2022-03-01 18:59:47,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 06:59:47" (1/1) ... [2022-03-01 18:59:47,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 18:59:47,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 18:59:47,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 18:59:47,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 18:59:47,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 06:59:47" (1/1) ... [2022-03-01 18:59:47,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 18:59:47,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 18:59:47,962 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-01 18:59:47,964 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-01 18:59:48,004 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-03-01 18:59:48,004 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-03-01 18:59:48,008 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-03-01 18:59:48,008 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-03-01 18:59:48,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 18:59:48,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-03-01 18:59:48,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 18:59:48,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 18:59:48,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 18:59:48,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-01 18:59:48,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-03-01 18:59:48,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 18:59:48,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 18:59:48,011 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 18:59:48,162 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 18:59:48,164 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 18:59:48,326 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 18:59:48,331 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 18:59:48,331 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-03-01 18:59:48,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 06:59:48 BoogieIcfgContainer [2022-03-01 18:59:48,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 18:59:48,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 18:59:48,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 18:59:48,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 18:59:48,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 06:59:47" (1/3) ... [2022-03-01 18:59:48,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a9e9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 06:59:48, skipping insertion in model container [2022-03-01 18:59:48,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 06:59:47" (2/3) ... [2022-03-01 18:59:48,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a9e9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 06:59:48, skipping insertion in model container [2022-03-01 18:59:48,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 06:59:48" (3/3) ... [2022-03-01 18:59:48,338 INFO L111 eAbstractionObserver]: Analyzing ICFG fib_safe-5.i [2022-03-01 18:59:48,341 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 18:59:48,341 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 18:59:48,341 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-01 18:59:48,341 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 18:59:48,361 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,361 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,361 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,361 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,362 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,362 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,362 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,362 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,362 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,362 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,363 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,363 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,363 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,363 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,363 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,363 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,363 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,364 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,364 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,364 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,364 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,364 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,364 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,364 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,364 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,364 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,365 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,365 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,365 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,365 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,365 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,365 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,365 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,366 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,366 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,366 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,368 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,368 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,368 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,368 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,368 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,370 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,370 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,370 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,370 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,370 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 18:59:48,370 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-03-01 18:59:48,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-03-01 18:59:48,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 18:59:48,413 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-01 18:59:48,414 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-01 18:59:48,434 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 18:59:48,440 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=false, mMcrOverapproximateWrwc=false [2022-03-01 18:59:48,440 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-03-01 18:59:48,489 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 91 transitions and produced 92 states. [2022-03-01 18:59:48,491 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 18:59:48,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 18:59:48,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1927097680, now seen corresponding path program 1 times [2022-03-01 18:59:48,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 18:59:48,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346706220] [2022-03-01 18:59:48,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 18:59:48,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 18:59:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 18:59:48,748 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-01 18:59:48,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 18:59:48,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346706220] [2022-03-01 18:59:48,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346706220] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 18:59:48,750 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 18:59:48,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 18:59:48,752 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606132638] [2022-03-01 18:59:48,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 18:59:48,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-01 18:59:48,756 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 18:59:48,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-01 18:59:48,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-01 18:59:48,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 18:59:48,778 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 18:59:48,779 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-01 18:59:48,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 18:59:48,813 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 91 transitions and produced 92 states. [2022-03-01 18:59:48,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 18:59:48,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 18:59:48,815 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 18:59:48,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 18:59:48,817 INFO L85 PathProgramCache]: Analyzing trace with hash 560415153, now seen corresponding path program 1 times [2022-03-01 18:59:48,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 18:59:48,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630911019] [2022-03-01 18:59:48,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 18:59:48,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 18:59:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 18:59:48,920 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-01 18:59:48,921 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 18:59:48,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630911019] [2022-03-01 18:59:48,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630911019] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 18:59:48,946 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 18:59:48,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 18:59:48,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371199938] [2022-03-01 18:59:48,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 18:59:48,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 18:59:48,948 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 18:59:48,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 18:59:48,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 18:59:48,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 18:59:48,949 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 18:59:48,949 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-01 18:59:48,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 18:59:48,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 18:59:48,975 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 114 transitions and produced 115 states. [2022-03-01 18:59:48,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 18:59:48,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 18:59:48,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 18:59:48,976 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 18:59:48,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 18:59:48,977 INFO L85 PathProgramCache]: Analyzing trace with hash -951035470, now seen corresponding path program 1 times [2022-03-01 18:59:48,977 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 18:59:48,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886118800] [2022-03-01 18:59:48,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 18:59:48,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 18:59:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 18:59:49,036 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-01 18:59:49,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 18:59:49,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886118800] [2022-03-01 18:59:49,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886118800] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 18:59:49,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107696896] [2022-03-01 18:59:49,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 18:59:49,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 18:59:49,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 18:59:49,051 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-01 18:59:49,052 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-01 18:59:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 18:59:49,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-01 18:59:49,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 18:59:49,318 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-01 18:59:49,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 18:59:49,404 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-01 18:59:49,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107696896] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 18:59:49,405 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 18:59:49,405 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-01 18:59:49,405 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208240251] [2022-03-01 18:59:49,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 18:59:49,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 18:59:49,406 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 18:59:49,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 18:59:49,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-01 18:59:49,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 18:59:49,407 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 18:59:49,407 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-01 18:59:49,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 18:59:49,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 18:59:49,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 18:59:49,705 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 160 transitions and produced 161 states. [2022-03-01 18:59:49,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 18:59:49,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 18:59:49,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 18:59:49,746 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-01 18:59:49,921 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-01 18:59:49,921 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 18:59:49,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 18:59:49,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1666707666, now seen corresponding path program 2 times [2022-03-01 18:59:49,922 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 18:59:49,922 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011041855] [2022-03-01 18:59:49,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 18:59:49,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 18:59:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 18:59:50,061 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-01 18:59:50,061 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 18:59:50,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011041855] [2022-03-01 18:59:50,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011041855] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 18:59:50,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119236044] [2022-03-01 18:59:50,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 18:59:50,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 18:59:50,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 18:59:50,063 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-01 18:59:50,064 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-01 18:59:50,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 18:59:50,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 18:59:50,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-01 18:59:50,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 18:59:50,224 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-01 18:59:50,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 18:59:50,344 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-01 18:59:50,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119236044] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 18:59:50,345 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 18:59:50,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-01 18:59:50,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041398452] [2022-03-01 18:59:50,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 18:59:50,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-01 18:59:50,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 18:59:50,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-01 18:59:50,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-01 18:59:50,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 18:59:50,346 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 18:59:50,346 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-01 18:59:50,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 18:59:50,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 18:59:50,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 18:59:50,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 18:59:50,754 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 252 transitions and produced 249 states. [2022-03-01 18:59:50,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 18:59:50,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 18:59:50,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 18:59:50,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-01 18:59:50,783 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-01 18:59:50,971 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-01 18:59:50,971 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 18:59:50,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 18:59:50,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1283180782, now seen corresponding path program 3 times [2022-03-01 18:59:50,972 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 18:59:50,972 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988342137] [2022-03-01 18:59:50,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 18:59:50,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 18:59:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 18:59:51,150 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-01 18:59:51,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 18:59:51,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988342137] [2022-03-01 18:59:51,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988342137] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 18:59:51,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434683017] [2022-03-01 18:59:51,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 18:59:51,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 18:59:51,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 18:59:51,156 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-01 18:59:51,158 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-01 18:59:51,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-03-01 18:59:51,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 18:59:51,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-01 18:59:51,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 18:59:51,381 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-01 18:59:51,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 18:59:51,588 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-01 18:59:51,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434683017] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 18:59:51,588 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 18:59:51,588 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2022-03-01 18:59:51,588 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083053796] [2022-03-01 18:59:51,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 18:59:51,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-01 18:59:51,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 18:59:51,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-01 18:59:51,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2022-03-01 18:59:51,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 18:59:51,591 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 18:59:51,591 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-01 18:59:51,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 18:59:51,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 18:59:51,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 18:59:51,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-01 18:59:51,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 18:59:52,146 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 367 transitions and produced 355 states. [2022-03-01 18:59:52,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 18:59:52,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 18:59:52,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 18:59:52,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-01 18:59:52,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-01 18:59:52,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-01 18:59:52,363 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-01 18:59:52,364 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 18:59:52,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 18:59:52,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1938020081, now seen corresponding path program 4 times [2022-03-01 18:59:52,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 18:59:52,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182218338] [2022-03-01 18:59:52,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 18:59:52,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 18:59:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 18:59:53,380 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-01 18:59:53,381 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 18:59:53,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182218338] [2022-03-01 18:59:53,381 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182218338] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 18:59:53,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863730396] [2022-03-01 18:59:53,381 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 18:59:53,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 18:59:53,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 18:59:53,383 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-01 18:59:53,384 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-01 18:59:53,468 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 18:59:53,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 18:59:53,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-01 18:59:53,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 18:59:56,038 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-01 18:59:56,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 19:00:03,697 WARN L838 $PredicateComparison]: unable to prove that (and (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) (+ 20 (* 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 8))) (>= 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 (<= (+ (* 5 aux_div_v_~next~0_20_56) c_~cur~0) (+ 20 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (>= 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_~i~0 8))) (> 0 aux_mod_v_~next~0_20_56)))) is different from false [2022-03-01 19:03:06,254 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_~i~0_8 Int)) (or (forall ((v_~j~0_8 Int)) (or (not (<= v_~j~0_8 1)) (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 ((.cse0 (* 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)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 v_~j~0_8) (* aux_mod_v_~next~0_20_56 2))) (< aux_div_v_~cur~0_22_51 (+ .cse0 c_~prev~0 1 c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 (* 2 aux_mod_v_~cur~0_22_51) 10 v_~j~0_8) (+ .cse0 (* 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_~cur~0_22_51) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~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 ((.cse1 (* 2 v_~cur~0_26))) (or (< (+ aux_mod_v_~next~0_20_56 (* 2 aux_mod_v_~cur~0_22_51) 10 v_~i~0_8) (+ .cse1 (* 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)) (< aux_div_v_~cur~0_22_51 (+ .cse1 c_~prev~0 1 c_~cur~0)) (> 0 aux_mod_v_~cur~0_22_51) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ (* 2 v_~i~0_8) 21 aux_mod_v_~cur~0_22_51 (* aux_mod_v_~next~0_20_56 2))) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56))))))) (not (<= v_~i~0_8 1)))) is different from false [2022-03-01 19:03:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 416 refuted. 2 times theorem prover too weak. 0 trivial. 56 not checked. [2022-03-01 19:03:39,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863730396] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 19:03:39,469 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 19:03:39,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 121 [2022-03-01 19:03:39,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338256181] [2022-03-01 19:03:39,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 19:03:39,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2022-03-01 19:03:39,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:03:39,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2022-03-01 19:03:39,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=934, Invalid=13067, Unknown=49, NotChecked=470, Total=14520 [2022-03-01 19:03:39,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:03:39,495 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:03:39,496 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-01 19:03:39,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:03:39,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:03:39,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:03:39,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-01 19:03:39,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-03-01 19:03:39,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:04:00,223 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse15 (* (- 1) c_~j~0)) (.cse4 (* (- 1) c_~i~0)) (.cse22 (* 2 c_~cur~0))) (let ((.cse0 (+ c_~prev~0 c_~cur~0)) (.cse3 (+ .cse22 c_~prev~0)) (.cse7 (div (+ (- 2) .cse4 c_~cur~0) (- 2))) (.cse6 (+ c_~next~0 1)) (.cse1 (+ c_~prev~0 c_~next~0)) (.cse5 (div (+ (- 2) .cse15 c_~cur~0) (- 2))) (.cse8 (+ c_~prev~0 1 c_~cur~0)) (.cse20 (+ (* 2 c_~next~0) 4 c_~cur~0)) (.cse14 (+ .cse22 3 c_~prev~0)) (.cse9 (div (+ .cse15 (- 4) c_~next~0) (- 2))) (.cse19 (+ 2 c_~next~0 c_~cur~0)) (.cse17 (+ c_~next~0 c_~cur~0)) (.cse18 (div (+ .cse4 (- 4) c_~next~0) (- 2))) (.cse10 (+ 2 c_~prev~0 c_~next~0))) (and (<= c_~i~0 .cse0) (<= c_~j~0 c_~next~0) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 20 (* 2 c_~i~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)) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 8) (+ (* 2 v_~cur~0_22) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56))) (<= c_~i~0 .cse1) (<= c_~j~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) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse2 (* 2 v_~cur~0_26))) (or (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse2 (* 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) (+ 21 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 (+ .cse2 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_~j~0 .cse3) (<= (div (+ c_~prev~0 .cse4) (- 2)) c_~next~0) (<= c_~j~0 c_~prev~0) (<= .cse5 .cse6) (<= c_~i~0 c_~next~0) (<= .cse7 .cse8) (<= .cse9 .cse10) (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 8) (+ (* 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) (+ 20 (* 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 (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 20 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 8) (+ (* 2 v_~cur~0_22) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (> 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 ((.cse11 (* 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 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse11 (* 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_~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) (+ 21 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 (+ .cse11 c_~prev~0 1)) (> 0 aux_mod_v_~next~0_20_56)))) (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 ((.cse12 (* 2 v_~cur~0_26))) (or (< v_~prev~0_24 (+ v_~cur~0_26 c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse12 (* 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_~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) (+ 21 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 (+ .cse12 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 ((.cse13 (* 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) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse13 1 c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse13 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))))))) (< v_~cur~0_26 (+ c_~prev~0 c_~cur~0)))) (<= (div (+ c_~prev~0 .cse4 (- 6) c_~cur~0) (- 2)) .cse14) (<= c_~j~0 c_~cur~0) (<= (div (+ c_~prev~0 .cse15) (- 2)) c_~next~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) (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) (> 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) 10) (+ .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) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2)))))) (<= c_~j~0 .cse17) (<= c_~j~0 .cse0) (<= c_~i~0 .cse3) (<= .cse7 .cse6) (<= .cse18 .cse19) (<= 0 c_~prev~0) (<= (div (+ .cse4 c_~next~0 (- 8) c_~cur~0) (- 2)) .cse20) (<= c_~j~0 .cse1) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 20 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 8) (+ (* 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)) (> 0 aux_mod_v_~next~0_20_56))) (<= c_~i~0 |c_ULTIMATE.start_main_~correct~0#1|) (<= .cse5 .cse8) (<= c_~j~0 |c_ULTIMATE.start_fib_#res#1|) (<= (div (+ .cse15 c_~next~0 (- 8) c_~cur~0) (- 2)) .cse20) (<= c_~i~0 c_~prev~0) (<= c_~i~0 c_~cur~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 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .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_~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)) (> 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) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2)))))) (<= c_~i~0 |c_ULTIMATE.start_fib_#res#1|) (<= (div (+ c_~prev~0 .cse15 (- 6) c_~cur~0) (- 2)) .cse14) (<= .cse9 .cse19) (<= c_~i~0 1) (<= c_~i~0 .cse17) (<= .cse18 .cse10) (<= 1 c_~cur~0) (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_~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 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ (* 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_~next~0_20_56 2) (> 0 aux_mod_v_~cur~0_22_51) (> 0 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))))) (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_~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) (+ 21 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_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ (* 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))))))))) is different from false [2022-03-01 19:04:00,340 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 414 transitions and produced 385 states. [2022-03-01 19:04:00,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:04:00,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:04:00,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:04:00,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-01 19:04:00,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-01 19:04:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-03-01 19:04:00,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-01 19:04:00,547 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-01 19:04:00,548 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 19:04:00,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:04:00,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2006804384, now seen corresponding path program 1 times [2022-03-01 19:04:00,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:04:00,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521565048] [2022-03-01 19:04:00,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:04:00,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:04:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:04:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2022-03-01 19:04:00,613 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:04:00,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521565048] [2022-03-01 19:04:00,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521565048] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 19:04:00,613 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 19:04:00,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 19:04:00,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236470885] [2022-03-01 19:04:00,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 19:04:00,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 19:04:00,614 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:04:00,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 19:04:00,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 19:04:00,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:04:00,615 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:04:00,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:04:00,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:04:00,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:04:00,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:04:00,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-01 19:04:00,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-03-01 19:04:00,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-03-01 19:04:00,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:04:04,735 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse17 (* (- 1) c_~j~0)) (.cse6 (* (- 1) c_~i~0)) (.cse24 (* 2 c_~cur~0))) (let ((.cse2 (+ c_~prev~0 c_~cur~0)) (.cse5 (+ .cse24 c_~prev~0)) (.cse9 (div (+ (- 2) .cse6 c_~cur~0) (- 2))) (.cse8 (+ c_~next~0 1)) (.cse3 (+ c_~prev~0 c_~next~0)) (.cse7 (div (+ (- 2) .cse17 c_~cur~0) (- 2))) (.cse10 (+ c_~prev~0 1 c_~cur~0)) (.cse22 (+ (* 2 c_~next~0) 4 c_~cur~0)) (.cse16 (+ .cse24 3 c_~prev~0)) (.cse11 (div (+ .cse17 (- 4) c_~next~0) (- 2))) (.cse21 (+ 2 c_~next~0 c_~cur~0)) (.cse19 (+ c_~next~0 c_~cur~0)) (.cse20 (div (+ .cse6 (- 4) c_~next~0) (- 2))) (.cse12 (+ 2 c_~prev~0 c_~next~0))) (and (forall ((v_~j~0_8 Int)) (or (not (<= v_~j~0_8 1)) (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 ((.cse0 (* 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)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 v_~j~0_8) (* aux_mod_v_~next~0_20_56 2))) (< aux_div_v_~cur~0_22_51 (+ .cse0 c_~prev~0 1 c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 (* 2 aux_mod_v_~cur~0_22_51) 10 v_~j~0_8) (+ .cse0 (* 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_~cur~0_22_51) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~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 ((.cse1 (* 2 v_~cur~0_26))) (or (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse1 (* 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) (+ 21 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 (+ .cse1 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 .cse2) (<= c_~j~0 c_~next~0) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 20 (* 2 c_~i~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)) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 8) (+ (* 2 v_~cur~0_22) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56))) (<= c_~i~0 .cse3) (<= c_~j~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) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse4 (* 2 v_~cur~0_26))) (or (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse4 (* 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) (+ 21 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 (+ .cse4 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_~j~0 .cse5) (<= (div (+ c_~prev~0 .cse6) (- 2)) c_~next~0) (<= c_~j~0 c_~prev~0) (<= .cse7 .cse8) (<= c_~i~0 c_~next~0) (<= .cse9 .cse10) (<= .cse11 .cse12) (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 8) (+ (* 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) (+ 20 (* 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 (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 20 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 8) (+ (* 2 v_~cur~0_22) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (> 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 ((.cse13 (* 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 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse13 (* 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_~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) (+ 21 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 (+ .cse13 c_~prev~0 1)) (> 0 aux_mod_v_~next~0_20_56)))) (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 ((.cse14 (* 2 v_~cur~0_26))) (or (< v_~prev~0_24 (+ v_~cur~0_26 c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse14 (* 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_~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) (+ 21 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 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 ((.cse15 (* 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) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse15 1 c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .cse15 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))))))) (< v_~cur~0_26 (+ c_~prev~0 c_~cur~0)))) (<= (div (+ c_~prev~0 .cse6 (- 6) c_~cur~0) (- 2)) .cse16) (<= c_~j~0 c_~cur~0) (<= (div (+ c_~prev~0 .cse17) (- 2)) c_~next~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) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse18 (* 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) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse18 c_~prev~0 1)) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ .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))) (> 0 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2)))))) (<= c_~j~0 .cse19) (<= c_~j~0 .cse2) (<= c_~i~0 .cse5) (<= .cse9 .cse8) (<= .cse20 .cse21) (<= 0 c_~prev~0) (<= (div (+ .cse6 c_~next~0 (- 8) c_~cur~0) (- 2)) .cse22) (<= c_~j~0 .cse3) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 20 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 8) (+ (* 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)) (> 0 aux_mod_v_~next~0_20_56))) (<= c_~i~0 |c_ULTIMATE.start_main_~correct~0#1|) (<= .cse7 .cse10) (<= c_~j~0 |c_ULTIMATE.start_fib_#res#1|) (<= (div (+ .cse17 c_~next~0 (- 8) c_~cur~0) (- 2)) .cse22) (<= c_~i~0 c_~prev~0) (<= c_~i~0 c_~cur~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 ((.cse23 (* 2 v_~cur~0_26))) (or (>= 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) 10) (+ .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_~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 (+ .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) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2)))))) (<= c_~i~0 |c_ULTIMATE.start_fib_#res#1|) (<= (div (+ c_~prev~0 .cse17 (- 6) c_~cur~0) (- 2)) .cse16) (<= .cse11 .cse21) (<= c_~i~0 .cse19) (<= .cse20 .cse12) (<= 1 c_~cur~0) (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_~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 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ (* 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_~next~0_20_56 2) (> 0 aux_mod_v_~cur~0_22_51) (> 0 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 21 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))))) (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_~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) (+ 21 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_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 10) (+ (* 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))))))))) is different from false [2022-03-01 19:04:04,848 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 414 transitions and produced 388 states. [2022-03-01 19:04:04,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:04:04,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:04:04,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:04:04,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-01 19:04:04,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-01 19:04:04,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-01 19:04:04,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:04:04,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-01 19:04:04,849 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 19:04:04,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:04:04,850 INFO L85 PathProgramCache]: Analyzing trace with hash -240107661, now seen corresponding path program 1 times [2022-03-01 19:04:04,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:04:04,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331566671] [2022-03-01 19:04:04,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:04:04,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:04:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:04:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-03-01 19:04:04,914 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:04:04,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331566671] [2022-03-01 19:04:04,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331566671] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 19:04:04,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210821512] [2022-03-01 19:04:04,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:04:04,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 19:04:04,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:04:04,916 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-01 19:04:04,979 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-01 19:04:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:04:05,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-01 19:04:05,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 19:04:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-03-01 19:04:05,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 19:04:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-03-01 19:04:05,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210821512] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 19:04:05,418 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 19:04:05,418 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-01 19:04:05,418 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652545738] [2022-03-01 19:04:05,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 19:04:05,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 19:04:05,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:04:05,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 19:04:05,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-01 19:04:05,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:04:05,419 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:04:05,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:04:05,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:04:05,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:04:05,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:04:05,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-01 19:04:05,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-03-01 19:04:05,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-03-01 19:04:05,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:04:05,420 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:04:05,842 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 398 transitions and produced 380 states. [2022-03-01 19:04:05,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:04:05,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:04:05,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:04:05,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-01 19:04:05,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-01 19:04:05,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-01 19:04:05,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:04:05,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-01 19:04:05,859 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-01 19:04:06,059 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-01 19:04:06,060 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 19:04:06,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:04:06,060 INFO L85 PathProgramCache]: Analyzing trace with hash -440658106, now seen corresponding path program 1 times [2022-03-01 19:04:06,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:04:06,060 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950226774] [2022-03-01 19:04:06,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:04:06,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:04:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:04:08,500 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:04:08,500 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:04:08,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950226774] [2022-03-01 19:04:08,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950226774] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 19:04:08,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960184591] [2022-03-01 19:04:08,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:04:08,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 19:04:08,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:04:08,504 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-01 19:04:08,505 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-01 19:04:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:04:08,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 43 conjunts are in the unsatisfiable core [2022-03-01 19:04:08,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 19:04:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 335 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:04:14,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 19:05:28,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_~cur~0_39 Int)) (or (not (<= c_~next~0 v_~cur~0_39)) (forall ((v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~next~0_36 (+ c_~prev~0 (* 2 v_~cur~0_39))) (< 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 ((.cse1 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse0 (+ (* v_~prev~0_37 3) v_~next~0_36))) (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)) (< .cse0 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 .cse1 11)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 13 .cse1) .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_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse3 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse2 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 13 .cse2) .cse3) (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (< .cse3 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 .cse2 11)))))))))) is different from false [2022-03-01 19:07:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 463 refuted. 2 times theorem prover too weak. 0 trivial. 11 not checked. [2022-03-01 19:07:53,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960184591] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 19:07:53,959 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 19:07:53,959 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 127 [2022-03-01 19:07:53,959 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583977246] [2022-03-01 19:07:53,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 19:07:53,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 127 states [2022-03-01 19:07:53,968 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:07:53,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2022-03-01 19:07:53,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=14759, Unknown=42, NotChecked=248, Total=16002 [2022-03-01 19:07:53,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:07:53,985 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:07:53,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 127 states, 127 states have (on average 3.220472440944882) internal successors, (409), 127 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:07:53,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:07:53,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:07:53,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:07:53,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-01 19:07:53,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-03-01 19:07:53,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-03-01 19:07:53,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:07:53,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-03-01 19:07:53,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:10:30,506 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse55 (* 2 c_~j~0)) (.cse39 (* (- 1) c_~j~0)) (.cse31 (* (- 1) c_~i~0)) (.cse67 (* 2 c_~cur~0))) (let ((.cse10 (+ 2 c_~prev~0 c_~next~0)) (.cse16 (+ c_~next~0 1)) (.cse8 (+ c_~next~0 c_~cur~0)) (.cse4 (+ .cse67 c_~prev~0)) (.cse9 (+ c_~j~0 (div (+ .cse31 (- 4) c_~next~0) (- 2)))) (.cse34 (+ c_~prev~0 c_~next~0)) (.cse40 (+ (div (+ (- 2) .cse31 c_~cur~0) (- 2)) c_~j~0)) (.cse15 (div (+ (- 2) .cse39 c_~cur~0) (- 2))) (.cse64 (+ c_~prev~0 1 c_~cur~0)) (.cse33 (+ (* 2 c_~next~0) 4 c_~cur~0)) (.cse7 (+ c_~i~0 .cse55)) (.cse49 (+ c_~prev~0 c_~cur~0)) (.cse32 (+ .cse67 3 c_~prev~0)) (.cse22 (div (+ .cse39 (- 4) c_~next~0) (- 2))) (.cse54 (+ 2 c_~next~0 c_~cur~0))) (and (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 c_~j~0 8) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))) (>= 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) (+ 20 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (< v_~cur~0_35 (+ c_~prev~0 c_~next~0)))) (<= c_~j~0 c_~next~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 ((.cse1 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse0 (+ (* v_~prev~0_37 3) v_~next~0_36))) (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)) (< .cse0 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 .cse1 11)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 13 .cse1) .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_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse3 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse2 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 13 .cse2) .cse3) (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (< .cse3 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 .cse2 11)))))))) (<= 144 |c_ULTIMATE.start_main_~correct~0#1|) (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) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 20 (* 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 8))))) (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) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 20 (* 2 c_~i~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_~i~0 8)))))))) (<= c_~j~0 .cse4) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse6 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse5 (+ (* 3 c_~prev~0) c_~next~0))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 5 c_~prev~0) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 2 c_~next~0)) 4) (* 2 aux_div_v_~cur~0_35_51))) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< .cse5 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 .cse6 11)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 13 .cse6) .cse5)))) (<= .cse7 .cse8) (<= (+ 143 c_~i~0) (+ |c_ULTIMATE.start_main_~correct~0#1| c_~j~0)) (<= c_~j~0 c_~prev~0) (<= .cse9 .cse10) (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 ((.cse12 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse11 (+ (* v_~prev~0_37 3) v_~next~0_36))) (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)) (< .cse11 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 .cse12 11)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 13 .cse12) .cse11) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51)))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.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 c_~i~0 13 .cse13) .cse14) (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (< .cse14 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 .cse13 11)))))))) (<= .cse15 .cse16) (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) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 20 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2))) (< v_~cur~0_35 (+ c_~next~0 c_~cur~0)) (< (+ aux_mod_v_~next~0_33_56 c_~i~0 8) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))))) (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) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 20 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (< (+ aux_mod_v_~next~0_33_56 c_~j~0 8) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_56) c_~cur~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) (< (+ aux_mod_v_~next~0_33_56 c_~i~0 8) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_56) c_~cur~0)) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 20 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2)))))))) (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 c_~j~0 8) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))) (>= 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) (+ 20 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (< v_~cur~0_35 (+ c_~next~0 c_~cur~0)))) (forall ((aux_mod_v_~cur~0_34_56 Int) (aux_div_v_~cur~0_34_56 Int)) (or (> 0 aux_mod_v_~cur~0_34_56) (<= (+ (* 5 aux_div_v_~cur~0_34_56) c_~prev~0) (+ (* 2 aux_mod_v_~cur~0_34_56) 15 (* 2 c_~j~0))) (>= aux_mod_v_~cur~0_34_56 2) (not (<= (+ c_~prev~0 c_~next~0 (* 2 aux_div_v_~cur~0_34_56)) (+ c_~j~0 6 aux_mod_v_~cur~0_34_56))))) (<= c_~i~0 (+ c_~j~0 1)) (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 14 (* 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_v_~j~0_10_159 Int) (aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse17 (* v_~prev~0_37 3))) (let ((.cse18 (* aux_div_v_~j~0_10_159 2)) (.cse19 (div (+ (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (- 5) (* 5 v_~prev~0_37)) 2)) (.cse21 (+ .cse17 v_~next~0_36)) (.cse20 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (<= (+ .cse17 .cse18) (+ c_~i~0 .cse19 .cse20 11)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 aux_div_v_~j~0_10_159 (* 2 aux_div_v_~cur~0_35_51))) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= (+ 14 c_~i~0 .cse20) .cse21) (<= (+ .cse18 1) (+ v_~next~0_36 .cse19)) (< .cse21 (+ c_~i~0 .cse20 11))))))) (< v_~next~0_36 (+ c_~prev~0 (* 2 v_~cur~0_39) c_~cur~0)))) (<= .cse22 .cse10) (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_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse24 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse23 (+ (* v_~prev~0_37 3) v_~next~0_36))) (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)) (< .cse23 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 .cse24 11)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 13 .cse24) .cse23) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51)))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse26 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse25 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 13 .cse25) .cse26) (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (< .cse26 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 .cse25 11)))))) (< v_~next~0_36 (+ c_~prev~0 (* 2 v_~cur~0_39) c_~cur~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) (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 8))) (<= (+ (* 5 aux_div_v_~next~0_33_56) c_~cur~0) (+ 20 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))))) (<= .cse7 |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) (+ 20 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (< (+ aux_mod_v_~next~0_33_56 c_~j~0 8) (+ (* 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)))) (= (+ (- 1) c_~j~0) 0) (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 ((.cse28 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse27 (+ (* v_~prev~0_37 3) v_~next~0_36))) (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)) (< .cse27 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 .cse28 11)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 13 .cse28) .cse27) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51)))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse30 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse29 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 13 .cse29) .cse30) (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (< .cse30 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 .cse29 11)))))))) (<= (+ (div (+ c_~prev~0 .cse31 (- 6) c_~cur~0) (- 2)) c_~j~0) .cse32) (<= (+ c_~j~0 (div (+ .cse31 c_~next~0 (- 8) c_~cur~0) (- 2))) .cse33) (<= .cse7 .cse34) (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) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) c_~cur~0) (+ 20 (* 2 c_~i~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_~i~0 8))))) (<= c_~j~0 c_~cur~0) (forall ((v_~next~0_36 Int)) (or (not (<= (+ c_~prev~0 c_~cur~0) v_~next~0_36)) (forall ((v_~prev~0_37 Int)) (or (not (<= c_~cur~0 v_~prev~0_37)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse36 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse35 (+ (* v_~prev~0_37 3) v_~next~0_36))) (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)) (< .cse35 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 .cse36 11)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 13 .cse36) .cse35) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51)))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.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 c_~i~0 13 .cse37) .cse38) (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (< .cse38 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 .cse37 11)))))))))) (<= (div (+ c_~prev~0 .cse39) (- 2)) c_~next~0) (<= .cse40 .cse16) (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 ((.cse42 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse41 (+ (* v_~prev~0_37 3) v_~next~0_36))) (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)) (< .cse41 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 .cse42 11)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 13 .cse42) .cse41) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51)))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse44 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse43 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 13 .cse43) .cse44) (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (< .cse44 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 .cse43 11)))))))) (<= c_~j~0 .cse8) (<= .cse7 c_~next~0) (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 ((.cse46 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse45 (+ (* v_~prev~0_37 3) v_~next~0_36))) (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)) (< .cse45 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 .cse46 11)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 13 .cse46) .cse45) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51)))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse48 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse47 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 13 .cse47) .cse48) (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (< .cse48 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 .cse47 11)))))) (< v_~next~0_36 (+ c_~next~0 c_~cur~0)))) (<= c_~j~0 .cse49) (<= c_~j~0 1) (<= .cse7 c_~cur~0) (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) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 20 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (< (+ aux_mod_v_~next~0_33_56 c_~j~0 8) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_56) c_~cur~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) (< (+ aux_mod_v_~next~0_33_56 c_~i~0 8) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_56) c_~cur~0)) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 20 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2)))))))) (<= .cse7 .cse4) (<= (+ c_~j~0 (div (+ c_~prev~0 .cse31) (- 2))) c_~next~0) (<= .cse7 c_~prev~0) (<= 0 c_~prev~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_~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 ((.cse51 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse50 (+ (* v_~prev~0_37 3) v_~next~0_36))) (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)) (< .cse50 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 .cse51 11)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 13 .cse51) .cse50) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51)))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse53 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse52 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 13 .cse52) .cse53) (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (< .cse53 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 .cse52 11)))))))) (<= .cse9 .cse54) (<= c_~i~0 (+ .cse55 1)) (forall ((v_~prev~0_37 Int)) (or (not (<= c_~cur~0 v_~prev~0_37)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse57 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse56 (+ (* 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) (< .cse56 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 .cse57 11)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 13 .cse57) .cse56) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51) (div (+ (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 2 c_~next~0) (* 5 v_~prev~0_37)) 4)))))) (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 ((.cse59 (+ (* v_~prev~0_37 3) c_~next~0)) (.cse58 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 13 .cse58) .cse59) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< .cse59 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 .cse58 11)) (<= 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))))))))) (forall ((aux_div_v_~next~0_33_56 Int) (v_~cur~0_35 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< v_~cur~0_35 (+ c_~prev~0 c_~next~0)) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 20 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2))) (< (+ aux_mod_v_~next~0_33_56 c_~i~0 8) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))))) (forall ((v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~next~0_36 (+ (* 2 c_~cur~0) c_~prev~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 ((.cse61 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse60 (+ (* v_~prev~0_37 3) v_~next~0_36))) (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)) (< .cse60 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 .cse61 11)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 13 .cse61) .cse60) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51)))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse63 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse62 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 13 .cse62) .cse63) (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (< .cse63 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 .cse62 11)))))) (< v_~prev~0_37 (+ c_~prev~0 c_~cur~0)))) (<= c_~j~0 .cse34) (<= .cse40 .cse64) (<= .cse15 .cse64) (<= c_~j~0 |c_ULTIMATE.start_fib_#res#1|) (<= (div (+ .cse39 c_~next~0 (- 8) c_~cur~0) (- 2)) .cse33) (<= .cse7 .cse49) (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_~i~0 8) (+ (* 2 v_~cur~0_35) c_~prev~0 (* 2 aux_div_v_~next~0_33_56) c_~cur~0)) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 20 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2))) (< v_~cur~0_35 (+ (* 2 c_~cur~0) c_~prev~0)))) (<= (div (+ c_~prev~0 .cse39 (- 6) c_~cur~0) (- 2)) .cse32) (<= .cse22 .cse54) (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 ((.cse66 (+ (* 3 c_~prev~0) c_~next~0)) (.cse65 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (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) (< 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 13 .cse65) .cse66) (< .cse66 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 .cse65 11))))) (forall ((aux_mod_v_~cur~0_34_56 Int) (aux_div_v_~cur~0_34_56 Int)) (or (> 0 aux_mod_v_~cur~0_34_56) (>= aux_mod_v_~cur~0_34_56 2) (<= (+ (* 5 aux_div_v_~cur~0_34_56) c_~j~0 c_~prev~0) (+ (* 2 aux_mod_v_~cur~0_34_56) 15 (* 2 c_~i~0))) (not (<= (+ c_~prev~0 c_~next~0 (* 2 aux_div_v_~cur~0_34_56)) (+ 6 c_~i~0 aux_mod_v_~cur~0_34_56))))) (<= 1 c_~cur~0)))) is different from false [2022-03-01 19:10:31,483 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 465 transitions and produced 424 states. [2022-03-01 19:10:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:10:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:10:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:10:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-01 19:10:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-01 19:10:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-01 19:10:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:10:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:10:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-03-01 19:10:31,501 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-01 19:10:31,684 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-01 19:10:31,685 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 19:10:31,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:10:31,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2032757810, now seen corresponding path program 1 times [2022-03-01 19:10:31,685 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:10:31,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286593161] [2022-03-01 19:10:31,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:10:31,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:10:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:10:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2022-03-01 19:10:31,848 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:10:31,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286593161] [2022-03-01 19:10:31,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286593161] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 19:10:31,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553359717] [2022-03-01 19:10:31,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:10:31,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 19:10:31,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:10:31,850 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-01 19:10:31,864 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-01 19:10:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:10:31,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-01 19:10:31,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 19:10:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2022-03-01 19:10:32,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 19:10:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2022-03-01 19:10:32,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553359717] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 19:10:32,371 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 19:10:32,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-01 19:10:32,373 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600224528] [2022-03-01 19:10:32,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 19:10:32,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-01 19:10:32,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:10:32,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-01 19:10:32,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-03-01 19:10:32,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:10:32,389 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:10:32,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:10:32,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:10:32,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:10:32,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:10:32,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-01 19:10:32,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-03-01 19:10:32,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-03-01 19:10:32,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:10:32,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:10:32,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-03-01 19:10:32,389 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:10:33,057 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 482 transitions and produced 440 states. [2022-03-01 19:10:33,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:10:33,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:10:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:10:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-01 19:10:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-01 19:10:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-03-01 19:10:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:10:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:10:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-03-01 19:10:33,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:10:33,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-01 19:10:33,271 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-01 19:10:33,272 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-03-01 19:10:33,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:10:33,272 INFO L85 PathProgramCache]: Analyzing trace with hash -858364429, now seen corresponding path program 2 times [2022-03-01 19:10:33,272 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:10:33,272 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178376356] [2022-03-01 19:10:33,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:10:33,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:10:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:10:35,810 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:10:35,810 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:10:35,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178376356] [2022-03-01 19:10:35,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178376356] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 19:10:35,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897915714] [2022-03-01 19:10:35,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 19:10:35,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 19:10:35,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:10:35,811 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-01 19:10:35,812 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-01 19:10:35,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 19:10:35,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 19:10:35,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 47 conjunts are in the unsatisfiable core [2022-03-01 19:10:35,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 19:10:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 335 proven. 194 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:10:42,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 19:13:18,172 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_~i~0_28 Int)) (or (not (<= v_~i~0_28 1)) (forall ((v_~j~0_15 Int)) (or (not (<= v_~j~0_15 1)) (and (forall ((v_~cur~0_50 Int) (aux_mod_v_~next~0_46_71 Int) (v_~cur~0_52 Int) (aux_div_v_~next~0_46_71 Int) (v_~cur~0_48 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_46_71) v_~cur~0_48) (+ (* v_~j~0_15 10) (* aux_mod_v_~next~0_46_71 2) 20 (* v_~i~0_28 2))) (< v_~cur~0_52 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ aux_mod_v_~next~0_46_71 v_~i~0_28 (* v_~j~0_15 5) 8) (+ (* 2 aux_div_v_~next~0_46_71) c_~prev~0 v_~cur~0_52 v_~cur~0_50 (* 2 v_~cur~0_48) c_~cur~0)) (>= aux_mod_v_~next~0_46_71 2) (< v_~cur~0_50 (+ (* 2 v_~cur~0_52) c_~prev~0 c_~cur~0)) (> 0 aux_mod_v_~next~0_46_71) (< v_~cur~0_48 (+ (* 2 v_~cur~0_50) c_~prev~0 v_~cur~0_52 c_~cur~0)))) (forall ((aux_div_v_~next~0_46_56 Int) (v_~cur~0_50 Int) (v_~cur~0_52 Int) (aux_mod_v_~next~0_46_56 Int) (v_~cur~0_48 Int)) (or (< v_~cur~0_52 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_46_56) (< v_~cur~0_50 (+ (* 2 v_~cur~0_52) c_~prev~0 c_~cur~0)) (>= aux_mod_v_~next~0_46_56 2) (< (+ aux_mod_v_~next~0_46_56 v_~i~0_28 8) (+ c_~prev~0 (* 2 aux_div_v_~next~0_46_56) v_~cur~0_52 v_~cur~0_50 (* 2 v_~cur~0_48) c_~cur~0)) (<= (+ (* v_~j~0_15 3) (* 5 aux_div_v_~next~0_46_56) v_~cur~0_48) (+ (* aux_mod_v_~next~0_46_56 2) 20 (* v_~i~0_28 2))) (< v_~cur~0_48 (+ (* 2 v_~cur~0_50) c_~prev~0 v_~cur~0_52 c_~cur~0))))))))) is different from false [2022-03-01 19:13:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 527 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:13:56,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897915714] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 19:13:56,970 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 19:13:56,970 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 139 [2022-03-01 19:13:56,970 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468160006] [2022-03-01 19:13:56,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 19:13:56,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2022-03-01 19:13:56,971 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:13:56,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2022-03-01 19:13:56,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1028, Invalid=17853, Unknown=29, NotChecked=272, Total=19182 [2022-03-01 19:13:56,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:13:56,974 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:13:56,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 139 states have (on average 3.4820143884892087) internal successors, (484), 139 states have internal predecessors, (484), 0 states have call successors, (0), 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-01 19:13:56,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:13:56,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:13:56,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:13:56,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-01 19:13:56,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-03-01 19:13:56,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-03-01 19:13:56,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:13:56,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:13:56,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-03-01 19:13:56,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:13:56,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Received shutdown request... [2022-03-01 19:14:22,785 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-01 19:14:22,785 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-01 19:14:22,790 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-01 19:14:23,358 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-01 19:14:23,543 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-01 19:14:23,543 WARN L594 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 142 known predicates. [2022-03-01 19:14:23,545 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-03-01 19:14:23,545 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-03-01 19:14:23,545 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-03-01 19:14:23,549 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2022-03-01 19:14:23,550 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-01 19:14:23,550 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-01 19:14:23,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.03 07:14:23 BasicIcfg [2022-03-01 19:14:23,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-01 19:14:23,552 INFO L158 Benchmark]: Toolchain (without parser) took 876071.37ms. Allocated memory was 163.6MB in the beginning and 362.8MB in the end (delta: 199.2MB). Free memory was 111.8MB in the beginning and 230.1MB in the end (delta: -118.2MB). Peak memory consumption was 80.5MB. Max. memory is 8.0GB. [2022-03-01 19:14:23,553 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-01 19:14:23,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.20ms. Allocated memory is still 163.6MB. Free memory was 111.6MB in the beginning and 129.7MB in the end (delta: -18.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-01 19:14:23,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.25ms. Allocated memory is still 163.6MB. Free memory was 129.7MB in the beginning and 127.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-01 19:14:23,554 INFO L158 Benchmark]: Boogie Preprocessor took 19.79ms. Allocated memory is still 163.6MB. Free memory was 127.9MB in the beginning and 126.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-01 19:14:23,555 INFO L158 Benchmark]: RCFGBuilder took 401.91ms. Allocated memory is still 163.6MB. Free memory was 126.2MB in the beginning and 113.2MB in the end (delta: 12.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-03-01 19:14:23,556 INFO L158 Benchmark]: TraceAbstraction took 875218.14ms. Allocated memory was 163.6MB in the beginning and 362.8MB in the end (delta: 199.2MB). Free memory was 112.9MB in the beginning and 230.1MB in the end (delta: -117.2MB). Peak memory consumption was 82.7MB. Max. memory is 8.0GB. [2022-03-01 19:14:23,564 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.15ms. Allocated memory is still 163.6MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 389.20ms. Allocated memory is still 163.6MB. Free memory was 111.6MB in the beginning and 129.7MB in the end (delta: -18.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.25ms. Allocated memory is still 163.6MB. Free memory was 129.7MB in the beginning and 127.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.79ms. Allocated memory is still 163.6MB. Free memory was 127.9MB in the beginning and 126.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 401.91ms. Allocated memory is still 163.6MB. Free memory was 126.2MB in the beginning and 113.2MB in the end (delta: 12.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 875218.14ms. Allocated memory was 163.6MB in the beginning and 362.8MB in the end (delta: 199.2MB). Free memory was 112.9MB in the beginning and 230.1MB in the end (delta: -117.2MB). Peak memory consumption was 82.7MB. 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 142 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 142 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 142 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 112 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 875.1s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 211.4s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 208, 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.5s SatisfiabilityAnalysisTime, 660.6s InterpolantComputationTime, 2271 NumberOfCodeBlocks, 2256 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3251 ConstructedInterpolants, 222 QuantifiedInterpolants, 44577 SizeOfPredicates, 150 NumberOfNonLiveVariables, 2115 ConjunctsInSsa, 171 ConjunctsInUnsatCore, 27 InterpolantComputations, 3 PerfectInterpolantSequences, 4331/8357 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